./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/dll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:42:01,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:42:01,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:42:01,699 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:42:01,700 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:42:01,723 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:42:01,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:42:01,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:42:01,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:42:01,728 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:42:01,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:42:01,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:42:01,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:42:01,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:42:01,729 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:42:01,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:42:01,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:42:01,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:42:01,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:42:01,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:42:01,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:42:01,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:42:01,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:42:01,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:42:01,731 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:42:01,731 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:42:01,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:42:01,732 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:42:01,732 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:42:01,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:42:01,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:42:01,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:42:01,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:42:01,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:42:01,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:42:01,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:42:01,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:42:01,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:42:01,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:42:01,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:42:01,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:42:01,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:42:01,735 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-clean/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-clean/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 -> 208d04089fa2c50848123d29dd18b6b2021c1b591464bd422fd10955aaeec7fc [2024-10-11 01:42:01,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:42:01,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:42:01,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:42:01,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:42:01,983 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:42:01,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2024-10-11 01:42:03,198 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:42:03,394 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:42:03,395 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_equal.i [2024-10-11 01:42:03,413 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/af2bb9ebe/21e51642990a44bd993d5de432ed9467/FLAG052ddb5eb [2024-10-11 01:42:03,754 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/af2bb9ebe/21e51642990a44bd993d5de432ed9467 [2024-10-11 01:42:03,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:42:03,758 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:42:03,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:42:03,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:42:03,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:42:03,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:42:03" (1/1) ... [2024-10-11 01:42:03,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c219fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:03, skipping insertion in model container [2024-10-11 01:42:03,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:42:03" (1/1) ... [2024-10-11 01:42:03,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:42:04,046 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/dll2c_append_equal.i[24585,24598] [2024-10-11 01:42:04,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:42:04,058 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:42:04,094 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/dll2c_append_equal.i[24585,24598] [2024-10-11 01:42:04,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:42:04,123 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:42:04,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04 WrapperNode [2024-10-11 01:42:04,124 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:42:04,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:42:04,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:42:04,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:42:04,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,179 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2024-10-11 01:42:04,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:42:04,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:42:04,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:42:04,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:42:04,196 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,245 INFO L175 MemorySlicer]: Split 29 memory accesses to 3 slices as follows [2, 18, 9]. 62 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 14 writes are split as follows [0, 13, 1]. [2024-10-11 01:42:04,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,252 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:42:04,262 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:42:04,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:42:04,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:42:04,263 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (1/1) ... [2024-10-11 01:42:04,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:42:04,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:04,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:42:04,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:42:04,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:42:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:42:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 01:42:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:42:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:42:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 01:42:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-10-11 01:42:04,329 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-10-11 01:42:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:42:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:42:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 01:42:04,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:42:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:42:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:42:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:42:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:42:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:42:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:42:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:42:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:42:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 01:42:04,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:42:04,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:42:04,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:42:04,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:42:04,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:42:04,458 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:42:04,460 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:42:04,675 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-10-11 01:42:04,675 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:42:04,712 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:42:04,715 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 01:42:04,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:42:04 BoogieIcfgContainer [2024-10-11 01:42:04,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:42:04,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:42:04,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:42:04,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:42:04,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:42:03" (1/3) ... [2024-10-11 01:42:04,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368d3be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:42:04, skipping insertion in model container [2024-10-11 01:42:04,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:42:04" (2/3) ... [2024-10-11 01:42:04,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@368d3be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:42:04, skipping insertion in model container [2024-10-11 01:42:04,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:42:04" (3/3) ... [2024-10-11 01:42:04,724 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_equal.i [2024-10-11 01:42:04,739 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:42:04,739 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:42:04,797 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:42:04,805 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;@2131b521, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:42:04,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:42:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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-11 01:42:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 01:42:04,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:04,817 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:04,817 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:04,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:04,822 INFO L85 PathProgramCache]: Analyzing trace with hash -540897351, now seen corresponding path program 1 times [2024-10-11 01:42:04,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:04,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052116351] [2024-10-11 01:42:04,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:04,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:42:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:05,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:42:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:05,115 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-11 01:42:05,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:05,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052116351] [2024-10-11 01:42:05,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052116351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:05,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:42:05,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:42:05,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27465203] [2024-10-11 01:42:05,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:05,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:42:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:05,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:42:05,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:42:05,142 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.565217391304348) internal successors, (36), 24 states have internal predecessors, (36), 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.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11 01:42:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:05,201 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2024-10-11 01:42:05,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:42:05,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 18 [2024-10-11 01:42:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:05,209 INFO L225 Difference]: With dead ends: 50 [2024-10-11 01:42:05,209 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 01:42:05,211 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-11 01:42:05,216 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:05,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:42:05,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 01:42:05,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 01:42:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-11 01:42:05,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-11 01:42:05,243 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2024-10-11 01:42:05,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:05,245 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-11 01:42:05,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-11 01:42:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-11 01:42:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 01:42:05,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:05,247 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:42:05,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:42:05,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:05,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:05,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2075980679, now seen corresponding path program 1 times [2024-10-11 01:42:05,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:05,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362539749] [2024-10-11 01:42:05,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:05,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:42:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:05,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:42:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:05,447 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-11 01:42:05,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:05,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362539749] [2024-10-11 01:42:05,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362539749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:05,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:42:05,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:42:05,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838819718] [2024-10-11 01:42:05,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:05,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:42:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:05,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:42:05,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:42:05,451 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11 01:42:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:05,515 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-10-11 01:42:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:42:05,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 18 [2024-10-11 01:42:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:05,516 INFO L225 Difference]: With dead ends: 41 [2024-10-11 01:42:05,516 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 01:42:05,517 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-11 01:42:05,518 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 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-11 01:42:05,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:42:05,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 01:42:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-11 01:42:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-11 01:42:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-10-11 01:42:05,529 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 18 [2024-10-11 01:42:05,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:05,530 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-10-11 01:42:05,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-11 01:42:05,530 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-10-11 01:42:05,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:42:05,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:05,531 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-11 01:42:05,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:42:05,532 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:05,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash 12333954, now seen corresponding path program 1 times [2024-10-11 01:42:05,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:05,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110131619] [2024-10-11 01:42:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:05,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:42:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:05,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:42:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:42:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:05,920 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-11 01:42:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110131619] [2024-10-11 01:42:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110131619] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:42:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892476282] [2024-10-11 01:42:05,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:05,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:05,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:05,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:42:05,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:42:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:06,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 01:42:06,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:42:06,222 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-11 01:42:06,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:42:06,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:42:06,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 21 [2024-10-11 01:42:06,388 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-11 01:42:06,392 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-11 01:42:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-11 01:42:06,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:42:06,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892476282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:42:06,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:42:06,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-10-11 01:42:06,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49878795] [2024-10-11 01:42:06,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:42:06,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 01:42:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:06,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 01:42:06,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-10-11 01:42:06,444 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 01:42:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:06,680 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-10-11 01:42:06,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 01:42:06,681 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-10-11 01:42:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:06,681 INFO L225 Difference]: With dead ends: 36 [2024-10-11 01:42:06,681 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 01:42:06,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-11 01:42:06,683 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:06,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 119 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:42:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 01:42:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2024-10-11 01:42:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:42:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-10-11 01:42:06,690 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 26 [2024-10-11 01:42:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:06,691 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-10-11 01:42:06,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-11 01:42:06,692 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-10-11 01:42:06,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 01:42:06,693 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:06,693 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-11 01:42:06,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 01:42:06,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:06,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:06,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:06,897 INFO L85 PathProgramCache]: Analyzing trace with hash 14180996, now seen corresponding path program 1 times [2024-10-11 01:42:06,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:06,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202990522] [2024-10-11 01:42:06,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:06,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:08,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:42:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:08,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:42:08,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:08,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:42:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:08,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:42:08,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:08,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202990522] [2024-10-11 01:42:08,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202990522] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:42:08,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250330193] [2024-10-11 01:42:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:08,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:08,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:08,930 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:42:08,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:42:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:09,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-10-11 01:42:09,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:42:09,424 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-11 01:42:09,592 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-11 01:42:09,668 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:42:09,669 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-11 01:42:09,746 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-11 01:42:09,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-11 01:42:09,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 48 [2024-10-11 01:42:09,981 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 8 treesize of output 1 [2024-10-11 01:42:09,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:42:09,996 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 39 [2024-10-11 01:42:10,002 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 26 treesize of output 15 [2024-10-11 01:42:10,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 56 [2024-10-11 01:42:10,100 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-11 01:42:10,105 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-11 01:42:10,279 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-11 01:42:10,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-10-11 01:42:10,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:42:10,293 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 112 treesize of output 65 [2024-10-11 01:42:10,307 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 01:42:10,308 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-11 01:42:10,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 1 [2024-10-11 01:42:10,488 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 84 treesize of output 52 [2024-10-11 01:42:10,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:42:10,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:42:10,494 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 45 treesize of output 36 [2024-10-11 01:42:10,498 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 26 treesize of output 15 [2024-10-11 01:42:10,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 01:42:10,623 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-11 01:42:10,623 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:42:10,718 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_682) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_683))) (or (not (= v_ArrVal_684 (store (select .cse0 .cse1) .cse2 (select v_ArrVal_684 .cse2)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_684) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2024-10-11 01:42:10,730 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_683 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_684 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse2 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse2) v_ArrVal_682) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_683))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store .cse0 .cse1 v_ArrVal_684) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (store (select .cse0 .cse1) .cse2 (select v_ArrVal_684 .cse2)) v_ArrVal_684)))))) is different from false [2024-10-11 01:42:10,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250330193] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:42:10,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 01:42:10,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2024-10-11 01:42:10,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081555350] [2024-10-11 01:42:10,883 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 01:42:10,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-10-11 01:42:10,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:10,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-10-11 01:42:10,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1756, Unknown=2, NotChecked=170, Total=2070 [2024-10-11 01:42:10,885 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-11 01:42:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:11,938 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2024-10-11 01:42:11,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 01:42:11,939 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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 26 [2024-10-11 01:42:11,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:11,940 INFO L225 Difference]: With dead ends: 51 [2024-10-11 01:42:11,940 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 01:42:11,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=243, Invalid=2955, Unknown=2, NotChecked=222, Total=3422 [2024-10-11 01:42:11,942 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:11,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 329 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 668 Invalid, 1 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 01:42:11,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 01:42:11,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2024-10-11 01:42:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 states have internal predecessors, (38), 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-11 01:42:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-10-11 01:42:11,953 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 26 [2024-10-11 01:42:11,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:11,953 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-10-11 01:42:11,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 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-11 01:42:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-10-11 01:42:11,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:42:11,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:11,954 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] [2024-10-11 01:42:11,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 01:42:12,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:12,155 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:12,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:12,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1030094310, now seen corresponding path program 1 times [2024-10-11 01:42:12,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:12,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111394396] [2024-10-11 01:42:12,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:12,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:12,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:42:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:12,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:42:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:12,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:42:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:12,372 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-11 01:42:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:12,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111394396] [2024-10-11 01:42:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111394396] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:42:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025567732] [2024-10-11 01:42:12,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:12,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:12,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:12,378 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:42:12,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:42:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:12,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 01:42:12,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:42:12,595 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-11 01:42:12,604 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-11 01:42:12,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:42:12,631 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-11 01:42:12,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025567732] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:42:12,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:42:12,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-10-11 01:42:12,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53843020] [2024-10-11 01:42:12,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:42:12,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 01:42:12,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:42:12,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 01:42:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 01:42:12,634 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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-11 01:42:16,639 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-11 01:42:20,648 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-11 01:42:24,661 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-11 01:42:28,674 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-11 01:42:32,680 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-11 01:42:36,860 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-11 01:42:40,879 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-11 01:42:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:42:40,885 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2024-10-11 01:42:40,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 01:42:40,887 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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 28 [2024-10-11 01:42:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:42:40,888 INFO L225 Difference]: With dead ends: 63 [2024-10-11 01:42:40,888 INFO L226 Difference]: Without dead ends: 41 [2024-10-11 01:42:40,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-10-11 01:42:40,889 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:42:40,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 165 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 28.2s Time] [2024-10-11 01:42:40,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-11 01:42:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-11 01:42:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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-11 01:42:40,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-10-11 01:42:40,899 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 28 [2024-10-11 01:42:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:42:40,899 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-10-11 01:42:40,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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-11 01:42:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-10-11 01:42:40,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:42:40,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:42:40,901 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] [2024-10-11 01:42:40,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:42:41,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:41,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:42:41,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:42:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash 744913052, now seen corresponding path program 1 times [2024-10-11 01:42:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:42:41,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946323939] [2024-10-11 01:42:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:41,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:42:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:41,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:42:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 01:42:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:42:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 01:42:42,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:42:42,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946323939] [2024-10-11 01:42:42,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946323939] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:42:42,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026084730] [2024-10-11 01:42:42,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:42:42,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:42:42,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:42:42,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:42:42,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:42:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:42:42,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-10-11 01:42:42,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:42:42,427 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-11 01:42:42,540 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:42:42,540 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-11 01:42:42,578 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-11 01:42:42,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:42:42,626 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 41 treesize of output 38 [2024-10-11 01:42:42,730 INFO L349 Elim1Store]: treesize reduction 84, result has 11.6 percent of original size [2024-10-11 01:42:42,730 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 39 [2024-10-11 01:42:42,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 17 [2024-10-11 01:42:42,785 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-11 01:42:42,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:42:42,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 57 treesize of output 34 [2024-10-11 01:42:42,913 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-10-11 01:42:42,913 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-11 01:42:43,105 INFO L349 Elim1Store]: treesize reduction 230, result has 27.2 percent of original size [2024-10-11 01:42:43,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 299 treesize of output 131 [2024-10-11 01:42:43,114 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 86 treesize of output 62 [2024-10-11 01:42:43,338 INFO L349 Elim1Store]: treesize reduction 738, result has 28.6 percent of original size [2024-10-11 01:42:43,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 479 treesize of output 328 [2024-10-11 01:42:43,345 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 221 treesize of output 151 [2024-10-11 01:42:47,785 INFO L349 Elim1Store]: treesize reduction 12, result has 99.3 percent of original size [2024-10-11 01:42:47,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 1838 treesize of output 3242