./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:37:26,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:37:26,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:37:27,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:37:27,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:37:27,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:37:27,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:37:27,022 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:37:27,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:37:27,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:37:27,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:37:27,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:37:27,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:37:27,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:37:27,026 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:37:27,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:37:27,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:37:27,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:37:27,027 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:37:27,027 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:37:27,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:37:27,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:37:27,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:37:27,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:37:27,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:37:27,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:37:27,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:37:27,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:37:27,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:37:27,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:37:27,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:37:27,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:37:27,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:37:27,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:37:27,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:37:27,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:37:27,032 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:37:27,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:37:27,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:37:27,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:37:27,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:37:27,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:37:27,034 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2024-11-16 06:37:27,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:37:27,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:37:27,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:37:27,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:37:27,341 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:37:27,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2024-11-16 06:37:28,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:37:28,900 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:37:28,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2024-11-16 06:37:28,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b674b2e30/6f592e7bc1fd4944830c7e7a1a3e37ec/FLAG9e071e02b [2024-11-16 06:37:28,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b674b2e30/6f592e7bc1fd4944830c7e7a1a3e37ec [2024-11-16 06:37:28,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:37:28,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:37:28,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:37:28,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:37:28,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:37:28,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:37:28" (1/1) ... [2024-11-16 06:37:28,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6311db55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:28, skipping insertion in model container [2024-11-16 06:37:28,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:37:28" (1/1) ... [2024-11-16 06:37:28,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:37:29,363 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2024-11-16 06:37:29,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:37:29,383 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:37:29,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2024-11-16 06:37:29,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:37:29,512 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:37:29,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29 WrapperNode [2024-11-16 06:37:29,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:37:29,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:37:29,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:37:29,518 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:37:29,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,586 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2024-11-16 06:37:29,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:37:29,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:37:29,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:37:29,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:37:29,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,664 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 7, 2]. [2024-11-16 06:37:29,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:37:29,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:37:29,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:37:29,700 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:37:29,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (1/1) ... [2024-11-16 06:37:29,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:37:29,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:29,739 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 06:37:29,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 06:37:29,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 06:37:29,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 06:37:29,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 06:37:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 06:37:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 06:37:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 06:37:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-16 06:37:29,795 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-16 06:37:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 06:37:29,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:37:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 06:37:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 06:37:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 06:37:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-16 06:37:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 06:37:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 06:37:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-16 06:37:29,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:37:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-16 06:37:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-16 06:37:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-16 06:37:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:37:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:37:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 06:37:29,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:37:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:37:29,895 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:37:29,897 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:37:30,069 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2024-11-16 06:37:30,089 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: assume true;havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2024-11-16 06:37:30,099 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-16 06:37:30,100 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:37:30,109 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:37:30,109 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:37:30,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:37:30 BoogieIcfgContainer [2024-11-16 06:37:30,110 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:37:30,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:37:30,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:37:30,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:37:30,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:37:28" (1/3) ... [2024-11-16 06:37:30,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c55f08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:37:30, skipping insertion in model container [2024-11-16 06:37:30,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:37:29" (2/3) ... [2024-11-16 06:37:30,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c55f08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:37:30, skipping insertion in model container [2024-11-16 06:37:30,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:37:30" (3/3) ... [2024-11-16 06:37:30,122 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2024-11-16 06:37:30,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:37:30,138 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:37:30,180 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:37:30,186 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;@533c90e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:37:30,186 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:37:30,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:37:30,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 06:37:30,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:30,197 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:30,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:30,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:30,201 INFO L85 PathProgramCache]: Analyzing trace with hash -311433262, now seen corresponding path program 1 times [2024-11-16 06:37:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542024131] [2024-11-16 06:37:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:30,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 06:37:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:30,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 06:37:30,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:30,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542024131] [2024-11-16 06:37:30,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542024131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:30,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:30,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:37:30,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476989384] [2024-11-16 06:37:30,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:30,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:37:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:30,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:37:30,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:37:30,478 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 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 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:37:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:30,526 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2024-11-16 06:37:30,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:37:30,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 25 [2024-11-16 06:37:30,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:30,533 INFO L225 Difference]: With dead ends: 69 [2024-11-16 06:37:30,533 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 06:37:30,535 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-11-16 06:37:30,538 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:30,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:37:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 06:37:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-16 06:37:30,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:37:30,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-16 06:37:30,566 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 25 [2024-11-16 06:37:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:30,567 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-16 06:37:30,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:37:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-16 06:37:30,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 06:37:30,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:30,569 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:30,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:37:30,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:30,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:30,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1489810420, now seen corresponding path program 1 times [2024-11-16 06:37:30,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:30,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859370040] [2024-11-16 06:37:30,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:30,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:30,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-16 06:37:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 06:37:30,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:30,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859370040] [2024-11-16 06:37:30,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859370040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:37:30,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:37:30,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:37:30,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147068354] [2024-11-16 06:37:30,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:37:30,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:37:30,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:30,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:37:30,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:37:30,783 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:37:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:30,835 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-11-16 06:37:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:37:30,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 26 [2024-11-16 06:37:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:30,837 INFO L225 Difference]: With dead ends: 54 [2024-11-16 06:37:30,837 INFO L226 Difference]: Without dead ends: 33 [2024-11-16 06:37:30,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:37:30,839 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:30,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 78 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:37:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-16 06:37:30,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2024-11-16 06:37:30,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:37:30,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-16 06:37:30,845 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 26 [2024-11-16 06:37:30,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:30,845 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-16 06:37:30,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 06:37:30,846 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-16 06:37:30,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 06:37:30,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:30,846 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:37:30,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:37:30,847 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:30,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:30,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1317319667, now seen corresponding path program 1 times [2024-11-16 06:37:30,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:30,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273517982] [2024-11-16 06:37:30,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:30,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:31,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:37:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:31,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:37:31,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:31,298 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 06:37:31,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:31,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273517982] [2024-11-16 06:37:31,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273517982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:37:31,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232448337] [2024-11-16 06:37:31,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:31,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:37:31,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:31,304 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:37:31,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 06:37:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:31,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-16 06:37:31,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:37:31,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-16 06:37:31,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:37:31,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:37:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 06:37:31,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232448337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:37:31,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:37:31,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 13 [2024-11-16 06:37:31,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252314212] [2024-11-16 06:37:31,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:37:31,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 06:37:31,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:31,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 06:37:31,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-16 06:37:31,686 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 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-11-16 06:37:35,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:39,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:43,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:47,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:51,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:55,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 06:37:55,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:55,931 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2024-11-16 06:37:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 06:37:55,934 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 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 35 [2024-11-16 06:37:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:55,934 INFO L225 Difference]: With dead ends: 46 [2024-11-16 06:37:55,934 INFO L226 Difference]: Without dead ends: 38 [2024-11-16 06:37:55,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-16 06:37:55,935 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:55,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 251 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 24.1s Time] [2024-11-16 06:37:55,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-16 06:37:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-16 06:37:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-16 06:37:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-16 06:37:55,949 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 35 [2024-11-16 06:37:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:55,949 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-16 06:37:55,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 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-11-16 06:37:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-16 06:37:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 06:37:55,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:55,950 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1] [2024-11-16 06:37:55,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 06:37:56,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:37:56,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:56,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 149293992, now seen corresponding path program 1 times [2024-11-16 06:37:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:56,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968754485] [2024-11-16 06:37:56,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:56,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:56,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:37:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:37:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:56,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:37:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:37:57,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:37:57,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968754485] [2024-11-16 06:37:57,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968754485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:37:57,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643635339] [2024-11-16 06:37:57,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:57,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:37:57,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:37:57,079 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:37:57,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 06:37:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:37:57,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-16 06:37:57,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:37:57,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 06:37:57,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-16 06:37:57,392 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-11-16 06:37:57,438 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-16 06:37:57,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-16 06:37:57,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 06:37:57,646 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 81 treesize of output 40 [2024-11-16 06:37:57,648 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 28 treesize of output 8 [2024-11-16 06:37:57,655 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 0 case distinctions, treesize of input 40 treesize of output 21 [2024-11-16 06:37:57,700 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-11-16 06:37:57,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-16 06:37:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 06:37:57,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:37:57,843 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 76 treesize of output 72 [2024-11-16 06:37:57,925 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (forall ((v_ArrVal_476 (Array Int Int)) (v_arrayElimCell_10 Int) (v_ArrVal_475 (Array Int Int))) (or (not (= v_ArrVal_476 (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_476 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_476) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_475) .cse6) (+ 4 v_arrayElimCell_10)))))) (.cse4 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4))) (and (or .cse0 .cse1) (or (not .cse0) (not .cse2) (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (or (not (= v_ArrVal_476 (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_476 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_476) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_475) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse4))))) (or .cse2 .cse1) (forall ((v_ArrVal_476 (Array Int Int))) (or (not (= v_ArrVal_476 (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_476 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (forall ((v_ArrVal_475 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_476) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_475))) (or (forall ((v_arrayElimCell_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 .cse6) (+ 4 v_arrayElimCell_10)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse5 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4)))))))))) is different from false [2024-11-16 06:37:58,057 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse5 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (forall ((v_ArrVal_476 (Array Int Int)) (v_arrayElimCell_10 Int) (v_ArrVal_475 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_476) .cse5 v_ArrVal_475) .cse4) (+ 4 v_arrayElimCell_10))) (not (= v_ArrVal_476 (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_476 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) (.cse7 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (forall ((v_ArrVal_476 (Array Int Int))) (or (not (= v_ArrVal_476 (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_476 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (forall ((v_ArrVal_475 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_476) .cse5 v_ArrVal_475))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse1 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse3)) (forall ((v_arrayElimCell_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse1 .cse4) (+ 4 v_arrayElimCell_10))))))))) (or (not .cse6) (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (or (not (= v_ArrVal_476 (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_476 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_476) .cse5 v_ArrVal_475) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse3)))) (not .cse7)) (or .cse8 .cse6) (or .cse8 .cse7))))) is different from false [2024-11-16 06:37:58,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) (let ((.cse1 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4)) (.cse2 (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse0 (forall ((v_ArrVal_476 (Array Int Int)) (v_arrayElimCell_10 Int) (v_ArrVal_475 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_476) .cse4 v_ArrVal_475) .cse8) (+ 4 v_arrayElimCell_10))) (not (= v_ArrVal_476 (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_476 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))))))) (and (or .cse0 .cse1) (or (not .cse2) (not .cse1) (forall ((v_ArrVal_476 (Array Int Int)) (v_ArrVal_475 (Array Int Int))) (or (not (= v_ArrVal_476 (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_476 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_476) .cse4 v_ArrVal_475) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) .cse5))))) (forall ((v_ArrVal_476 (Array Int Int))) (or (forall ((v_ArrVal_475 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_476) .cse4 v_ArrVal_475))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse5)) (forall ((v_arrayElimCell_10 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select .cse6 .cse8) (+ 4 v_arrayElimCell_10))))))) (not (= v_ArrVal_476 (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_476 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))))) (or .cse2 .cse0))))) is different from false [2024-11-16 06:37:58,193 INFO L349 Elim1Store]: treesize reduction 12, result has 78.9 percent of original size [2024-11-16 06:37:58,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 582 treesize of output 587 [2024-11-16 06:37:58,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:37:58,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 542 treesize of output 535 [2024-11-16 06:37:58,221 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 526 treesize of output 518 [2024-11-16 06:37:58,234 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 518 treesize of output 510 [2024-11-16 06:37:58,246 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 510 treesize of output 506 [2024-11-16 06:37:58,633 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 114 treesize of output 106 [2024-11-16 06:37:58,699 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 114 treesize of output 106 [2024-11-16 06:37:58,740 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:37:58,778 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 54 treesize of output 50 [2024-11-16 06:37:58,788 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 61 treesize of output 53 [2024-11-16 06:37:58,798 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 7 treesize of output 3 [2024-11-16 06:37:58,804 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 61 treesize of output 53 [2024-11-16 06:37:58,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:37:58,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:37:58,817 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:37:58,825 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:37:58,826 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:37:58,828 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-16 06:37:58,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643635339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:37:58,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:37:58,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2024-11-16 06:37:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658928087] [2024-11-16 06:37:58,881 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:37:58,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-16 06:37:58,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:37:58,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-16 06:37:58,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1173, Unknown=3, NotChecked=210, Total=1482 [2024-11-16 06:37:58,883 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 26 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 06:37:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:37:59,622 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2024-11-16 06:37:59,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 06:37:59,622 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 26 states have internal predecessors, (58), 5 states have call successors, (6), 3 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 38 [2024-11-16 06:37:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:37:59,624 INFO L225 Difference]: With dead ends: 76 [2024-11-16 06:37:59,624 INFO L226 Difference]: Without dead ends: 67 [2024-11-16 06:37:59,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=2274, Unknown=3, NotChecked=294, Total=2756 [2024-11-16 06:37:59,626 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 40 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 06:37:59,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 596 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 06:37:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-16 06:37:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2024-11-16 06:37:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 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-11-16 06:37:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2024-11-16 06:37:59,633 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 38 [2024-11-16 06:37:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:37:59,633 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2024-11-16 06:37:59,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 26 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-16 06:37:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2024-11-16 06:37:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 06:37:59,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:37:59,634 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-16 06:37:59,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 06:37:59,838 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-11-16 06:37:59,839 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:37:59,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:37:59,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1916698951, now seen corresponding path program 1 times [2024-11-16 06:37:59,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:37:59,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977132714] [2024-11-16 06:37:59,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:37:59,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:37:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:38:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:01,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:38:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:01,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:38:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:01,267 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:38:01,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:38:01,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977132714] [2024-11-16 06:38:01,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977132714] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:01,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230732237] [2024-11-16 06:38:01,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:01,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:38:01,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:38:01,270 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:38:01,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 06:38:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:01,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 110 conjuncts are in the unsatisfiable core [2024-11-16 06:38:01,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:38:01,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 06:38:01,660 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:38:01,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-16 06:38:01,723 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-11-16 06:38:01,800 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-16 06:38:01,801 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 34 treesize of output 33 [2024-11-16 06:38:01,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-16 06:38:01,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-16 06:38:02,050 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-11-16 06:38:02,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:38:02,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 38 treesize of output 27 [2024-11-16 06:38:02,139 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-16 06:38:02,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2024-11-16 06:38:02,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:02,488 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:38:02,489 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 44 treesize of output 16 [2024-11-16 06:38:02,643 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 73 treesize of output 40 [2024-11-16 06:38:02,647 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 28 treesize of output 8 [2024-11-16 06:38:02,655 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 0 case distinctions, treesize of input 40 treesize of output 21 [2024-11-16 06:38:02,685 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-16 06:38:02,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 22 [2024-11-16 06:38:02,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-16 06:38:02,741 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-11-16 06:38:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:38:02,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:38:02,900 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_659 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_659) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_661) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_659 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_659 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2024-11-16 06:38:02,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_659 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_659) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) v_ArrVal_661) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_659 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_659 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2024-11-16 06:38:02,996 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_659 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_659) (select (select |c_#memory_$Pointer$#1.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_661) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (= v_ArrVal_659 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_659 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2024-11-16 06:38:03,014 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_659 (Array Int Int)) (v_ArrVal_661 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_659) (select (select |c_#memory_$Pointer$#1.base| (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) v_ArrVal_661) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= v_ArrVal_659 (store (select |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_659 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))))) is different from false [2024-11-16 06:38:03,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:03,083 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 268 treesize of output 272 [2024-11-16 06:38:03,091 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 238 treesize of output 206 [2024-11-16 06:38:03,126 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 19 treesize of output 3 [2024-11-16 06:38:03,141 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 306 treesize of output 274 [2024-11-16 06:38:03,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230732237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:03,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:38:03,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2024-11-16 06:38:03,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14015872] [2024-11-16 06:38:03,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:38:03,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-16 06:38:03,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:38:03,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-16 06:38:03,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2223, Unknown=4, NotChecked=388, Total=2756 [2024-11-16 06:38:03,400 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 46 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 37 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 06:38:05,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:38:05,894 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2024-11-16 06:38:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-16 06:38:05,894 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 37 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2024-11-16 06:38:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:38:05,895 INFO L225 Difference]: With dead ends: 79 [2024-11-16 06:38:05,895 INFO L226 Difference]: Without dead ends: 76 [2024-11-16 06:38:05,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=404, Invalid=5928, Unknown=4, NotChecked=636, Total=6972 [2024-11-16 06:38:05,898 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 98 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:38:05,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 579 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 06:38:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-16 06:38:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2024-11-16 06:38:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 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-11-16 06:38:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-16 06:38:05,906 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 40 [2024-11-16 06:38:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:38:05,906 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-16 06:38:05,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 37 states have internal predecessors, (65), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-16 06:38:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-16 06:38:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-16 06:38:05,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:38:05,908 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1] [2024-11-16 06:38:05,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 06:38:06,108 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-11-16 06:38:06,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:38:06,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:38:06,109 INFO L85 PathProgramCache]: Analyzing trace with hash -590909978, now seen corresponding path program 1 times [2024-11-16 06:38:06,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:38:06,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66575151] [2024-11-16 06:38:06,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:38:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:06,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-16 06:38:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:06,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 06:38:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:06,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 06:38:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 06:38:06,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:38:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66575151] [2024-11-16 06:38:06,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66575151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:38:06,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925297122] [2024-11-16 06:38:06,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:38:06,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:38:06,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:38:06,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 06:38:06,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 06:38:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:38:07,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-16 06:38:07,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:38:07,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-16 06:38:07,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-16 06:38:07,444 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 18 treesize of output 7 [2024-11-16 06:38:07,521 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-16 06:38:07,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-16 06:38:07,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-16 06:38:07,959 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2024-11-16 06:38:07,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 109 [2024-11-16 06:38:07,989 INFO L349 Elim1Store]: treesize reduction 57, result has 16.2 percent of original size [2024-11-16 06:38:07,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 39 [2024-11-16 06:38:08,003 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-16 06:38:08,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2024-11-16 06:38:08,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:08,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 251 treesize of output 283 [2024-11-16 06:38:08,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-16 06:38:08,889 INFO L349 Elim1Store]: treesize reduction 48, result has 87.8 percent of original size [2024-11-16 06:38:08,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 201 treesize of output 449 [2024-11-16 06:38:08,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:38:08,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 153