./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.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 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 00:48:07,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 00:48:07,924 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 00:48:07,928 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 00:48:07,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 00:48:07,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 00:48:07,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 00:48:07,951 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 00:48:07,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 00:48:07,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 00:48:07,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 00:48:07,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 00:48:07,954 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 00:48:07,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 00:48:07,955 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 00:48:07,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 00:48:07,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 00:48:07,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 00:48:07,956 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 00:48:07,956 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 00:48:07,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 00:48:07,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 00:48:07,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 00:48:07,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 00:48:07,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 00:48:07,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 00:48:07,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 00:48:07,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 00:48:07,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 00:48:07,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 00:48:07,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 00:48:07,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 00:48:07,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:48:07,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 00:48:07,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 00:48:07,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 00:48:07,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 00:48:07,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 00:48:07,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 00:48:07,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 00:48:07,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 00:48:07,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 00:48:07,962 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 -> 2f8161fc7f730bddeac54a8f174c52e5ef9cd819e9497e3a4087e68b96d46105 [2024-11-22 00:48:08,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 00:48:08,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 00:48:08,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 00:48:08,219 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 00:48:08,220 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 00:48:08,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-22 00:48:09,581 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 00:48:09,787 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 00:48:09,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i [2024-11-22 00:48:09,802 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db23883f7/202cb46ce90340039ab7ddfcbf2e4c74/FLAG941daf054 [2024-11-22 00:48:09,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db23883f7/202cb46ce90340039ab7ddfcbf2e4c74 [2024-11-22 00:48:09,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 00:48:09,819 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 00:48:09,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 00:48:09,820 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 00:48:09,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 00:48:09,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:48:09" (1/1) ... [2024-11-22 00:48:09,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456d4fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:09, skipping insertion in model container [2024-11-22 00:48:09,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:48:09" (1/1) ... [2024-11-22 00:48:09,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 00:48:10,159 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/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2024-11-22 00:48:10,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2024-11-22 00:48:10,164 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/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2024-11-22 00:48:10,166 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/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2024-11-22 00:48:10,167 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/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2024-11-22 00:48:10,169 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/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2024-11-22 00:48:10,170 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/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2024-11-22 00:48:10,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:48:10,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 00:48:10,224 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/forester-heap/dll-rb-cnstr_1-1.i[22569,22582] [2024-11-22 00:48:10,226 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/forester-heap/dll-rb-cnstr_1-1.i[22645,22658] [2024-11-22 00:48:10,227 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/forester-heap/dll-rb-cnstr_1-1.i[22715,22728] [2024-11-22 00:48:10,232 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/forester-heap/dll-rb-cnstr_1-1.i[22822,22835] [2024-11-22 00:48:10,232 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/forester-heap/dll-rb-cnstr_1-1.i[22894,22907] [2024-11-22 00:48:10,233 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/forester-heap/dll-rb-cnstr_1-1.i[23045,23058] [2024-11-22 00:48:10,234 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/forester-heap/dll-rb-cnstr_1-1.i[23119,23132] [2024-11-22 00:48:10,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 00:48:10,266 INFO L204 MainTranslator]: Completed translation [2024-11-22 00:48:10,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10 WrapperNode [2024-11-22 00:48:10,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 00:48:10,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 00:48:10,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 00:48:10,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 00:48:10,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,301 INFO L138 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 151 [2024-11-22 00:48:10,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 00:48:10,302 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 00:48:10,302 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 00:48:10,302 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 00:48:10,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,325 INFO L175 MemorySlicer]: Split 29 memory accesses to 2 slices as follows [2, 27]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 12 writes are split as follows [0, 12]. [2024-11-22 00:48:10,326 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 00:48:10,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 00:48:10,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 00:48:10,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 00:48:10,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (1/1) ... [2024-11-22 00:48:10,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 00:48:10,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:48:10,374 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-22 00:48:10,376 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-22 00:48:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 00:48:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 00:48:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 00:48:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 00:48:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 00:48:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 00:48:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 00:48:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 00:48:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 00:48:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 00:48:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 00:48:10,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 00:48:10,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 00:48:10,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 00:48:10,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 00:48:10,491 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 00:48:10,493 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 00:48:10,661 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-22 00:48:10,661 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 00:48:10,673 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 00:48:10,674 INFO L316 CfgBuilder]: Removed 17 assume(true) statements. [2024-11-22 00:48:10,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:48:10 BoogieIcfgContainer [2024-11-22 00:48:10,675 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 00:48:10,677 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 00:48:10,677 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 00:48:10,679 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 00:48:10,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:48:09" (1/3) ... [2024-11-22 00:48:10,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767d6594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:48:10, skipping insertion in model container [2024-11-22 00:48:10,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:48:10" (2/3) ... [2024-11-22 00:48:10,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767d6594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:48:10, skipping insertion in model container [2024-11-22 00:48:10,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:48:10" (3/3) ... [2024-11-22 00:48:10,681 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-1.i [2024-11-22 00:48:10,694 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 00:48:10,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-22 00:48:10,752 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 00:48:10,757 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;@18fe4196, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 00:48:10,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-22 00:48:10,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:10,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 00:48:10,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:48:10,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 00:48:10,766 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-22 00:48:10,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:48:10,771 INFO L85 PathProgramCache]: Analyzing trace with hash 891600134, now seen corresponding path program 1 times [2024-11-22 00:48:10,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:48:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820698581] [2024-11-22 00:48:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:48:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:10,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:48:10,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820698581] [2024-11-22 00:48:10,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820698581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:48:10,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:48:10,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 00:48:10,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825243770] [2024-11-22 00:48:10,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:48:10,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 00:48:10,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:48:11,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 00:48:11,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:48:11,006 INFO L87 Difference]: Start difference. First operand has 47 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 46 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:48:11,025 INFO L93 Difference]: Finished difference Result 92 states and 150 transitions. [2024-11-22 00:48:11,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 00:48:11,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-22 00:48:11,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:48:11,034 INFO L225 Difference]: With dead ends: 92 [2024-11-22 00:48:11,034 INFO L226 Difference]: Without dead ends: 41 [2024-11-22 00:48:11,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 00:48:11,045 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:48:11,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:48:11,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-22 00:48:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-22 00:48:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 40 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2024-11-22 00:48:11,080 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 6 [2024-11-22 00:48:11,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:48:11,081 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2024-11-22 00:48:11,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2024-11-22 00:48:11,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 00:48:11,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:48:11,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:48:11,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 00:48:11,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-22 00:48:11,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:48:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1806905862, now seen corresponding path program 1 times [2024-11-22 00:48:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:48:11,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377728645] [2024-11-22 00:48:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:11,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:48:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:48:11,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377728645] [2024-11-22 00:48:11,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377728645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:48:11,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:48:11,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:48:11,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016697955] [2024-11-22 00:48:11,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:48:11,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:48:11,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:48:11,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:48:11,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:48:11,227 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:48:11,292 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-22 00:48:11,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:48:11,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 00:48:11,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:48:11,293 INFO L225 Difference]: With dead ends: 44 [2024-11-22 00:48:11,294 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 00:48:11,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:48:11,296 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 64 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:48:11,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 37 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:48:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 00:48:11,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-22 00:48:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-22 00:48:11,305 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 7 [2024-11-22 00:48:11,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:48:11,305 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-22 00:48:11,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-22 00:48:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 00:48:11,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:48:11,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:48:11,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 00:48:11,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-22 00:48:11,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:48:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash 179566605, now seen corresponding path program 1 times [2024-11-22 00:48:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:48:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869881150] [2024-11-22 00:48:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:48:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:11,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:11,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:48:11,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869881150] [2024-11-22 00:48:11,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869881150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:48:11,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:48:11,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:48:11,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033576665] [2024-11-22 00:48:11,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:48:11,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:48:11,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:48:11,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:48:11,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:48:11,526 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:48:11,575 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-22 00:48:11,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:48:11,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 00:48:11,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:48:11,577 INFO L225 Difference]: With dead ends: 37 [2024-11-22 00:48:11,578 INFO L226 Difference]: Without dead ends: 35 [2024-11-22 00:48:11,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:48:11,579 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 00:48:11,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 78 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 00:48:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-22 00:48:11,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-22 00:48:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-22 00:48:11,586 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 8 [2024-11-22 00:48:11,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:48:11,586 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-22 00:48:11,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,586 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-22 00:48:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 00:48:11,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:48:11,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:48:11,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 00:48:11,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-22 00:48:11,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:48:11,587 INFO L85 PathProgramCache]: Analyzing trace with hash 711412120, now seen corresponding path program 1 times [2024-11-22 00:48:11,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:48:11,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030065497] [2024-11-22 00:48:11,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:11,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:48:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:11,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:11,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:48:11,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030065497] [2024-11-22 00:48:11,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030065497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:48:11,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:48:11,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:48:11,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666650210] [2024-11-22 00:48:11,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:48:11,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:48:11,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:48:11,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:48:11,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:48:11,719 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:48:11,809 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2024-11-22 00:48:11,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:48:11,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-22 00:48:11,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:48:11,810 INFO L225 Difference]: With dead ends: 60 [2024-11-22 00:48:11,810 INFO L226 Difference]: Without dead ends: 58 [2024-11-22 00:48:11,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:48:11,812 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 42 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:48:11,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 90 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:48:11,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-22 00:48:11,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2024-11-22 00:48:11,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-22 00:48:11,823 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 10 [2024-11-22 00:48:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:48:11,824 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-22 00:48:11,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-11-22 00:48:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 00:48:11,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:48:11,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:48:11,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 00:48:11,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-22 00:48:11,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:48:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2056579816, now seen corresponding path program 1 times [2024-11-22 00:48:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:48:11,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148333705] [2024-11-22 00:48:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:11,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:48:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:12,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:48:12,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148333705] [2024-11-22 00:48:12,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148333705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:48:12,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:48:12,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 00:48:12,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333854809] [2024-11-22 00:48:12,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:48:12,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 00:48:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:48:12,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 00:48:12,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 00:48:12,010 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:12,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:48:12,091 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-22 00:48:12,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 00:48:12,093 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 00:48:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:48:12,093 INFO L225 Difference]: With dead ends: 42 [2024-11-22 00:48:12,093 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 00:48:12,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:48:12,094 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:48:12,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 70 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:48:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 00:48:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 00:48:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-22 00:48:12,105 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 11 [2024-11-22 00:48:12,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:48:12,105 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-22 00:48:12,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:12,105 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2024-11-22 00:48:12,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 00:48:12,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:48:12,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:48:12,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 00:48:12,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-22 00:48:12,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:48:12,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1285114177, now seen corresponding path program 1 times [2024-11-22 00:48:12,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:48:12,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505208270] [2024-11-22 00:48:12,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:12,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:48:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:12,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:48:12,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505208270] [2024-11-22 00:48:12,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505208270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 00:48:12,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 00:48:12,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 00:48:12,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215289894] [2024-11-22 00:48:12,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 00:48:12,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 00:48:12,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:48:12,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 00:48:12,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 00:48:12,162 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:12,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:48:12,245 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-11-22 00:48:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 00:48:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-22 00:48:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:48:12,248 INFO L225 Difference]: With dead ends: 55 [2024-11-22 00:48:12,248 INFO L226 Difference]: Without dead ends: 43 [2024-11-22 00:48:12,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 00:48:12,249 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:48:12,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 79 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:48:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-22 00:48:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-11-22 00:48:12,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:12,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-22 00:48:12,259 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 14 [2024-11-22 00:48:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:48:12,259 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-22 00:48:12,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2024-11-22 00:48:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 00:48:12,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:48:12,260 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:48:12,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 00:48:12,261 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-22 00:48:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:48:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1621160418, now seen corresponding path program 1 times [2024-11-22 00:48:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:48:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379544270] [2024-11-22 00:48:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:48:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:12,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:12,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:48:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379544270] [2024-11-22 00:48:12,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379544270] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:48:12,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41558248] [2024-11-22 00:48:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:12,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:48:12,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:48:12,387 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-22 00:48:12,388 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-22 00:48:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:12,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 00:48:12,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:48:12,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-22 00:48:12,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-22 00:48:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:12,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:48:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:12,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41558248] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:48:12,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:48:12,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-22 00:48:12,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718833228] [2024-11-22 00:48:12,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:48:12,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 00:48:12,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:48:12,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 00:48:12,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 00:48:12,737 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:48:12,878 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2024-11-22 00:48:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 00:48:12,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-22 00:48:12,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:48:12,879 INFO L225 Difference]: With dead ends: 59 [2024-11-22 00:48:12,879 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 00:48:12,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 00:48:12,879 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 00:48:12,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 129 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 00:48:12,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 00:48:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-22 00:48:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:12,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-22 00:48:12,884 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 17 [2024-11-22 00:48:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:48:12,884 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-22 00:48:12,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-22 00:48:12,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 00:48:12,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:48:12,885 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 00:48:12,896 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-22 00:48:13,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:48:13,089 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-22 00:48:13,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:48:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1036168340, now seen corresponding path program 1 times [2024-11-22 00:48:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:48:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279720556] [2024-11-22 00:48:13,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:48:13,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:13,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:13,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:48:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279720556] [2024-11-22 00:48:13,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279720556] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:48:13,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556475886] [2024-11-22 00:48:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:13,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:48:13,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:48:13,549 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-22 00:48:13,550 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-22 00:48:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:13,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-22 00:48:13,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:48:13,655 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-22 00:48:13,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 00:48:13,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:13,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2024-11-22 00:48:13,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2024-11-22 00:48:13,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-22 00:48:13,734 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 10 treesize of output 8 [2024-11-22 00:48:13,751 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 00:48:13,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-22 00:48:13,777 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:48:13,778 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-22 00:48:13,792 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 00:48:13,826 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 00:48:13,831 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 00:48:13,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 46 [2024-11-22 00:48:13,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:13,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2024-11-22 00:48:13,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 50 [2024-11-22 00:48:13,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 75 [2024-11-22 00:48:13,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:13,864 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 22 treesize of output 19 [2024-11-22 00:48:13,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-22 00:48:13,880 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 00:48:13,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2024-11-22 00:48:13,900 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 00:48:14,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:14,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:48:14,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:14,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 54 [2024-11-22 00:48:14,128 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 100 treesize of output 92 [2024-11-22 00:48:14,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:14,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 78 [2024-11-22 00:48:14,137 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 170 treesize of output 126 [2024-11-22 00:48:14,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 31 treesize of output 29 [2024-11-22 00:48:14,144 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 29 treesize of output 27 [2024-11-22 00:48:14,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:14,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 75 [2024-11-22 00:48:14,227 INFO L349 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2024-11-22 00:48:14,228 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 3 case distinctions, treesize of input 21 treesize of output 13 [2024-11-22 00:48:14,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:14,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 240 [2024-11-22 00:48:14,383 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 451 treesize of output 355 [2024-11-22 00:48:14,388 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 316 treesize of output 304 [2024-11-22 00:48:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:20,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556475886] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 00:48:20,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 00:48:20,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-22 00:48:20,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844579385] [2024-11-22 00:48:20,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 00:48:20,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 00:48:20,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 00:48:20,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 00:48:20,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=118, Unknown=1, NotChecked=0, Total=156 [2024-11-22 00:48:20,540 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:21,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 00:48:21,368 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2024-11-22 00:48:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 00:48:21,368 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 00:48:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 00:48:21,370 INFO L225 Difference]: With dead ends: 81 [2024-11-22 00:48:21,370 INFO L226 Difference]: Without dead ends: 79 [2024-11-22 00:48:21,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=116, Invalid=303, Unknown=1, NotChecked=0, Total=420 [2024-11-22 00:48:21,372 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 137 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 00:48:21,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 139 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 00:48:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-22 00:48:21,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 35. [2024-11-22 00:48:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-22 00:48:21,384 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2024-11-22 00:48:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 00:48:21,384 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-22 00:48:21,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 00:48:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-22 00:48:21,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 00:48:21,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 00:48:21,385 INFO L215 NwaCegarLoop]: trace histogram [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-22 00:48:21,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 00:48:21,586 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,SelfDestructingSolverStorable7 [2024-11-22 00:48:21,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-22 00:48:21,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 00:48:21,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1438350182, now seen corresponding path program 1 times [2024-11-22 00:48:21,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 00:48:21,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507172541] [2024-11-22 00:48:21,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:21,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 00:48:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:22,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 00:48:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507172541] [2024-11-22 00:48:22,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507172541] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 00:48:22,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133118751] [2024-11-22 00:48:22,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 00:48:22,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 00:48:22,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 00:48:22,116 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-22 00:48:22,117 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-22 00:48:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 00:48:22,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-22 00:48:22,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 00:48:22,215 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-22 00:48:22,300 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 00:48:22,301 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-22 00:48:22,310 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-22 00:48:22,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:22,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 00:48:22,326 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2024-11-22 00:48:22,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:22,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-22 00:48:22,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2024-11-22 00:48:22,356 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-22 00:48:22,356 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 2 case distinctions, treesize of input 142 treesize of output 104 [2024-11-22 00:48:22,361 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-22 00:48:22,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:22,451 INFO L349 Elim1Store]: treesize reduction 33, result has 29.8 percent of original size [2024-11-22 00:48:22,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 132 [2024-11-22 00:48:22,467 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-22 00:48:22,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-22 00:48:22,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:22,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2024-11-22 00:48:22,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-22 00:48:22,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2024-11-22 00:48:22,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2024-11-22 00:48:22,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:22,540 INFO L349 Elim1Store]: treesize reduction 82, result has 1.2 percent of original size [2024-11-22 00:48:22,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 158 [2024-11-22 00:48:22,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:22,565 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2024-11-22 00:48:22,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 137 treesize of output 106 [2024-11-22 00:48:22,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:22,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:22,601 INFO L349 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2024-11-22 00:48:22,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 104 [2024-11-22 00:48:22,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:23,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:23,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 00:48:23,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2024-11-22 00:48:23,236 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-22 00:48:23,236 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 33 [2024-11-22 00:48:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 00:48:23,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 00:48:23,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:23,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 439 treesize of output 409 [2024-11-22 00:48:23,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:23,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1108 treesize of output 970 [2024-11-22 00:48:25,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:25,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 170 [2024-11-22 00:48:25,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:25,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 215 [2024-11-22 00:48:25,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:25,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 170 [2024-11-22 00:48:25,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:25,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 217 [2024-11-22 00:48:29,633 WARN L873 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_521 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_13) .cse1 v_ArrVal_521))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= .cse0 0) (= .cse0 .cse1) (forall ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_14))) (let ((.cse7 (select .cse6 .cse1))) (let ((.cse8 (let ((.cse9 (store .cse6 .cse1 (store .cse7 4 v_DerPreprocessor_4)))) (store .cse9 .cse0 (store (store (select .cse9 .cse0) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5))))) (let ((.cse3 (select (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse2 (select (select (store .cse6 .cse1 (store .cse7 4 (select (select .cse8 .cse1) 4))) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= v_DerPreprocessor_3 (+ 8 .cse2))) (= .cse3 0) (forall ((v_ArrVal_527 (Array Int Int))) (or (not (= (select v_ArrVal_527 .cse2) 0)) (not (= (select (let ((.cse4 (store .cse5 .cse0 v_ArrVal_527))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse3) 0)))) (not (= v_DerPreprocessor_2 .cse2)))))))))))) (not (= (select |c_#valid| .cse1) 0))))) (not (= (select v_arrayElimArr_14 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse18 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_14)) (.cse19 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse20 (select .cse18 .cse19))) (let ((.cse10 (select (select (store .cse18 .cse19 (store .cse20 4 v_ArrVal_524)) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (+ .cse10 4) 0) (= .cse10 4) (forall ((v_ArrVal_521 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_13) .cse19 v_ArrVal_521))) (let ((.cse11 (select (select .cse16 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= .cse11 0) (forall ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse15 (let ((.cse21 (store .cse18 .cse19 (store .cse20 4 v_DerPreprocessor_4)))) (store .cse21 .cse11 (store (store (select .cse21 .cse11) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5))))) (let ((.cse17 (select (select .cse15 .cse19) 4))) (let ((.cse12 (select (select (store .cse18 .cse19 (store .cse20 4 .cse17)) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= v_DerPreprocessor_3 (+ 8 .cse12))) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse14 (store .cse16 .cse11 v_ArrVal_527))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select v_ArrVal_527 .cse12) 0)) (= .cse13 0) (not (= (select (select .cse14 .cse13) (select (select .cse15 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 0)))))) (not (= .cse17 v_DerPreprocessor_4)) (not (= v_DerPreprocessor_2 .cse12))))))))))) (not (= (select |c_#valid| .cse19) 0))))))) (not (= (select v_arrayElimArr_14 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (let ((.cse23 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_521 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_13) .cse23 v_ArrVal_521))) (let ((.cse22 (select (select .cse28 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= .cse22 0) (= .cse22 .cse23) (forall ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse29 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_14))) (let ((.cse30 (select .cse29 .cse23))) (let ((.cse27 (let ((.cse31 (store .cse29 .cse23 (store .cse30 4 v_DerPreprocessor_4)))) (store .cse31 .cse22 (store (store (select .cse31 .cse22) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5))))) (let ((.cse24 (select (select (store .cse29 .cse23 (store .cse30 4 (select (select .cse27 .cse23) 4))) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= v_DerPreprocessor_3 (+ 8 .cse24))) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse26 (store .cse28 .cse22 v_ArrVal_527))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select v_ArrVal_527 .cse24) 0)) (= .cse25 0) (not (= (select (select .cse26 .cse25) (select (select .cse27 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 0)))))) (not (= v_DerPreprocessor_2 .cse24)))))))))))) (not (= (select |c_#valid| .cse23) 0))))) (not (= (select v_arrayElimArr_14 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse32 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_18)) (.cse33 (select v_arrayElimArr_17 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (+ (select (select (store .cse32 .cse33 (store (select .cse32 .cse33) 4 v_ArrVal_524)) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 4) 0)) (forall ((v_ArrVal_521 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_17) .cse33 v_ArrVal_521))) (let ((.cse34 (select (select .cse37 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= .cse33 .cse34)) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse36 (store .cse37 .cse34 v_ArrVal_527))) (let ((.cse35 (select (select .cse36 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select v_ArrVal_527 (- 4)) 0)) (= .cse35 0) (forall ((v_DerPreprocessor_7 Int)) (not (= (select (select .cse36 .cse35) (select (select (store .cse32 .cse34 (store (store (select .cse32 .cse34) (- 4) 0) 4 v_DerPreprocessor_7)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 0))))))))))) (not (= 0 (select |c_#valid| .cse33)))))) (not (= 0 (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~end~0#1.offset|))))) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (let ((.cse44 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_521 (Array Int Int))) (let ((.cse41 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_13) .cse44 v_ArrVal_521))) (let ((.cse42 (select (select .cse41 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse43 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_14))) (let ((.cse45 (select .cse43 .cse44))) (let ((.cse46 (store .cse43 .cse44 (store .cse45 4 v_DerPreprocessor_4)))) (let ((.cse47 (store .cse46 .cse42 (store (store (select .cse46 .cse42) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5)))) (let ((.cse39 (select (select .cse47 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse38 (select (select .cse47 .cse44) 4))) (or (not (= .cse38 v_DerPreprocessor_2)) (= .cse39 0) (forall ((v_ArrVal_527 (Array Int Int))) (or (not (= (select v_ArrVal_527 .cse38) 0)) (not (= (select (let ((.cse40 (store .cse41 .cse42 v_ArrVal_527))) (select .cse40 (select (select .cse40 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse39) 0)))) (not (= v_DerPreprocessor_3 (+ .cse38 8))) (= (select (select (store .cse43 .cse44 (store .cse45 4 (select (select (store .cse46 0 (store (store (select .cse46 0) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5)) .cse44) 4))) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 0)))))))) (= .cse42 .cse44))))) (not (= (select |c_#valid| .cse44) 0))))) (not (= (select v_arrayElimArr_14 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse54 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_14)) (.cse55 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse56 (select .cse54 .cse55))) (let ((.cse48 (select (select (store .cse54 .cse55 (store .cse56 4 v_ArrVal_524)) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (+ .cse48 4) 0) (= .cse48 4) (forall ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_13) .cse55 v_ArrVal_521))) (let ((.cse57 (store .cse54 .cse55 (store .cse56 4 v_DerPreprocessor_4))) (.cse53 (select (select .cse52 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse58 (store .cse57 .cse53 (store (store (select .cse57 .cse53) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5)))) (let ((.cse50 (select (select .cse58 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse49 (select (select .cse58 .cse55) 4))) (or (not (= .cse49 v_DerPreprocessor_2)) (= .cse50 0) (forall ((v_ArrVal_527 (Array Int Int))) (or (not (= (select v_ArrVal_527 .cse49) 0)) (not (= (select (let ((.cse51 (store .cse52 .cse53 v_ArrVal_527))) (select .cse51 (select (select .cse51 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse50) 0)))) (not (= v_DerPreprocessor_3 (+ .cse49 8))) (= (select (select (store .cse54 .cse55 (store .cse56 4 (select (select (store .cse57 0 (store (store (select .cse57 0) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5)) .cse55) 4))) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 0) (not (= .cse49 v_DerPreprocessor_4)))))))) (not (= (select |c_#valid| .cse55) 0))))))) (not (= (select v_arrayElimArr_14 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)))) (forall ((v_arrayElimArr_16 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)) (forall ((v_ArrVal_527 (Array Int Int))) (or (not (= (select v_ArrVal_527 4) 0)) (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse63 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_16)) (.cse64 (select v_arrayElimArr_15 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_521 (Array Int Int))) (let ((.cse61 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_15) .cse64 v_ArrVal_521))) (let ((.cse62 (select (select .cse61 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_DerPreprocessor_6 Int)) (let ((.cse59 (select (select (store .cse63 .cse62 (store (store (select .cse63 .cse62) 4 0) 12 v_DerPreprocessor_6)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= .cse59 0) (not (= (select (let ((.cse60 (store .cse61 .cse62 v_ArrVal_527))) (select .cse60 (select (select .cse60 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse59) 0))))) (not (= .cse62 .cse64)))))) (not (= (select (select (store .cse63 .cse64 (store (select .cse63 .cse64) 4 v_ArrVal_524)) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 4)) (not (= (select |c_#valid| .cse64) 0))))))))) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int))) (let ((.cse72 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_521 (Array Int Int))) (let ((.cse69 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_13) .cse72 v_ArrVal_521))) (let ((.cse70 (select (select .cse69 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse71 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_14))) (let ((.cse73 (select .cse71 .cse72))) (let ((.cse74 (store .cse71 .cse72 (store .cse73 4 v_DerPreprocessor_4)))) (let ((.cse68 (store .cse74 .cse70 (store (store (select .cse74 .cse70) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5)))) (let ((.cse65 (select (select .cse68 .cse72) 4))) (or (not (= .cse65 v_DerPreprocessor_2)) (not (= v_DerPreprocessor_3 (+ .cse65 8))) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse67 (store .cse69 .cse70 v_ArrVal_527))) (let ((.cse66 (select (select .cse67 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select v_ArrVal_527 .cse65) 0)) (= .cse66 0) (not (= (select (select .cse67 .cse66) (select (select .cse68 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 0)))))) (= (select (select (store .cse71 .cse72 (store .cse73 4 (select (select (store .cse74 0 (store (store (select .cse74 0) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5)) .cse72) 4))) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 0)))))))) (= .cse70 .cse72))))) (not (= (select |c_#valid| .cse72) 0))))) (not (= (select v_arrayElimArr_14 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)))) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse82 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_14)) (.cse83 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse84 (select .cse82 .cse83))) (let ((.cse75 (select (select (store .cse82 .cse83 (store .cse84 4 v_ArrVal_524)) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (= (+ .cse75 4) 0) (= .cse75 4) (forall ((v_ArrVal_521 (Array Int Int))) (let ((.cse79 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_13) .cse83 v_ArrVal_521))) (let ((.cse80 (select (select .cse79 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int)) (let ((.cse85 (let ((.cse86 (store .cse82 .cse83 (store .cse84 4 v_DerPreprocessor_4)))) (store .cse86 .cse80 (store (store (select .cse86 .cse80) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5))))) (let ((.cse81 (select (select .cse85 .cse83) 4))) (let ((.cse77 (select (select .cse85 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (.cse76 (select (select (store .cse82 .cse83 (store .cse84 4 .cse81)) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= v_DerPreprocessor_3 (+ 8 .cse76))) (= .cse77 0) (forall ((v_ArrVal_527 (Array Int Int))) (or (not (= (select v_ArrVal_527 .cse76) 0)) (not (= (select (let ((.cse78 (store .cse79 .cse80 v_ArrVal_527))) (select .cse78 (select (select .cse78 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse77) 0)))) (not (= .cse81 v_DerPreprocessor_4)) (not (= v_DerPreprocessor_2 .cse76))))))) (= .cse80 0))))) (not (= (select |c_#valid| .cse83) 0))))))) (not (= (select v_arrayElimArr_14 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)))) (forall ((v_arrayElimArr_16 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 |c_ULTIMATE.start_main_~end~0#1.offset|) 0)) (forall ((v_ArrVal_527 (Array Int Int))) (or (forall ((v_arrayElimArr_15 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse87 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_16)) (.cse88 (select v_arrayElimArr_15 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (select (select (store .cse87 .cse88 (store (select .cse87 .cse88) 4 v_ArrVal_524)) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 4)) (not (= (select |c_#valid| .cse88) 0)) (forall ((v_ArrVal_521 (Array Int Int))) (let ((.cse92 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_15) .cse88 v_ArrVal_521))) (let ((.cse91 (select (select .cse92 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse90 (store .cse92 .cse91 v_ArrVal_527))) (let ((.cse89 (select (select .cse90 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= .cse89 0) (forall ((v_DerPreprocessor_6 Int)) (not (= (select (select .cse90 .cse89) (select (select (store .cse87 .cse91 (store (store (select .cse87 .cse91) 4 0) 12 v_DerPreprocessor_6)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 0))) (not (= .cse91 .cse88))))))))))) (not (= (select v_ArrVal_527 4) 0)))))) (forall ((v_arrayElimArr_18 (Array Int Int))) (or (forall ((v_arrayElimArr_17 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse93 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_18)) (.cse94 (select v_arrayElimArr_17 |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (not (= (+ (select (select (store .cse93 .cse94 (store (select .cse93 .cse94) 4 v_ArrVal_524)) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 4) 0)) (forall ((v_ArrVal_521 (Array Int Int))) (let ((.cse97 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_17) .cse94 v_ArrVal_521))) (let ((.cse98 (select (select .cse97 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_ArrVal_527 (Array Int Int))) (or (not (= (select v_ArrVal_527 (- 4)) 0)) (forall ((v_DerPreprocessor_7 Int)) (let ((.cse95 (select (select (store .cse93 .cse98 (store (store (select .cse93 .cse98) (- 4) 0) 4 v_DerPreprocessor_7)) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (= .cse95 0) (not (= (select (let ((.cse96 (store .cse97 .cse98 v_ArrVal_527))) (select .cse96 (select (select .cse96 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) .cse95) 0))))))) (not (= .cse94 .cse98)))))) (not (= 0 (select |c_#valid| .cse94)))))) (not (= 0 (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~end~0#1.offset|))))) (forall ((v_arrayElimArr_14 (Array Int Int))) (or (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_524 Int)) (let ((.cse105 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_14)) (.cse106 (select v_arrayElimArr_13 |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse107 (select .cse105 .cse106))) (let ((.cse109 (select (select (store .cse105 .cse106 (store .cse107 4 v_ArrVal_524)) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (or (forall ((v_DerPreprocessor_5 Int) (v_DerPreprocessor_4 Int) (v_DerPreprocessor_3 Int) (v_DerPreprocessor_2 Int) (v_ArrVal_521 (Array Int Int))) (let ((.cse103 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimArr_13) .cse106 v_ArrVal_521))) (let ((.cse108 (store .cse105 .cse106 (store .cse107 4 v_DerPreprocessor_4))) (.cse104 (select (select .cse103 |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse102 (store .cse108 .cse104 (store (store (select .cse108 .cse104) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5)))) (let ((.cse99 (select (select .cse102 .cse106) 4))) (or (not (= .cse99 v_DerPreprocessor_2)) (not (= v_DerPreprocessor_3 (+ .cse99 8))) (forall ((v_ArrVal_527 (Array Int Int))) (let ((.cse101 (store .cse103 .cse104 v_ArrVal_527))) (let ((.cse100 (select (select .cse101 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (or (not (= (select v_ArrVal_527 .cse99) 0)) (= .cse100 0) (not (= (select (select .cse101 .cse100) (select (select .cse102 |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 0)))))) (= (select (select (store .cse105 .cse106 (store .cse107 4 (select (select (store .cse108 0 (store (store (select .cse108 0) v_DerPreprocessor_2 0) v_DerPreprocessor_3 v_DerPreprocessor_5)) .cse106) 4))) |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) 0) (not (= .cse99 v_DerPreprocessor_4)))))))) (= (+ .cse109 4) 0) (= .cse109 4) (not (= (select |c_#valid| .cse106) 0))))))) (not (= (select v_arrayElimArr_14 |c_ULTIMATE.start_main_~end~0#1.offset|) 0))))) is different from true [2024-11-22 00:48:38,092 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-22 00:48:38,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:38,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28065 treesize of output 21146 [2024-11-22 00:48:46,152 WARN L286 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-22 00:48:46,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 00:48:46,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21137 treesize of output 15274