./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c7aa3cc4b1f15d564db90712e4f440d0f111d49f542d9eda58173576bb757792 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:22:32,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:22:32,545 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:22:32,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:22:32,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:22:32,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:22:32,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:22:32,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:22:32,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:22:32,593 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:22:32,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:22:32,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:22:32,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:22:32,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:22:32,593 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:22:32,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:22:32,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:22:32,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:22:32,598 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:32,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:22:32,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:22:32,599 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:22:32,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:22:32,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:22:32,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:22:32,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:22:32,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:22:32,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:22:32,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:22:32,599 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> c7aa3cc4b1f15d564db90712e4f440d0f111d49f542d9eda58173576bb757792 [2025-02-07 21:22:32,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:22:32,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:22:32,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:22:32,859 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:22:32,859 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:22:32,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-07 21:22:33,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04a0a7f23/fe8c2a5cb75b49efa388595a041afc6b/FLAG5f4b5aff2 [2025-02-07 21:22:34,315 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:22:34,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-07 21:22:34,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04a0a7f23/fe8c2a5cb75b49efa388595a041afc6b/FLAG5f4b5aff2 [2025-02-07 21:22:34,567 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04a0a7f23/fe8c2a5cb75b49efa388595a041afc6b [2025-02-07 21:22:34,569 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:22:34,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:22:34,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:34,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:22:34,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:22:34,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:34" (1/1) ... [2025-02-07 21:22:34,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:34, skipping insertion in model container [2025-02-07 21:22:34,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:22:34" (1/1) ... [2025-02-07 21:22:34,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:22:34,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9421,9434] [2025-02-07 21:22:34,886 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12913,12926] [2025-02-07 21:22:34,894 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14069,14082] [2025-02-07 21:22:34,898 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14725,14738] [2025-02-07 21:22:34,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16246,16259] [2025-02-07 21:22:34,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16902,16915] [2025-02-07 21:22:34,917 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17886,17899] [2025-02-07 21:22:34,929 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20224,20237] [2025-02-07 21:22:34,933 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20883,20896] [2025-02-07 21:22:34,939 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21907,21920] [2025-02-07 21:22:34,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23782,23795] [2025-02-07 21:22:34,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:35,008 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:22:35,048 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[9421,9434] [2025-02-07 21:22:35,055 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[12913,12926] [2025-02-07 21:22:35,058 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14069,14082] [2025-02-07 21:22:35,060 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[14725,14738] [2025-02-07 21:22:35,062 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16246,16259] [2025-02-07 21:22:35,064 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[16902,16915] [2025-02-07 21:22:35,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[17886,17899] [2025-02-07 21:22:35,069 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20224,20237] [2025-02-07 21:22:35,075 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[20883,20896] [2025-02-07 21:22:35,077 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[21907,21920] [2025-02-07 21:22:35,081 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c[23782,23795] [2025-02-07 21:22:35,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:22:35,126 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:22:35,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35 WrapperNode [2025-02-07 21:22:35,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:22:35,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:35,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:22:35,128 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:22:35,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,152 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,196 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2022 [2025-02-07 21:22:35,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:22:35,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:22:35,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:22:35,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:22:35,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,207 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,243 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-07 21:22:35,243 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,243 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:22:35,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:22:35,294 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:22:35,294 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:22:35,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (1/1) ... [2025-02-07 21:22:35,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:22:35,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:22:35,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:22:35,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:22:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:22:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:22:35,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:22:35,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:22:35,480 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:22:35,481 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:22:36,590 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L927: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-07 21:22:36,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1886: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~17#1; [2025-02-07 21:22:36,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2316: havoc main_~main____CPAchecker_TMP_0~8#1;havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~22#1; [2025-02-07 21:22:36,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1094: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-07 21:22:36,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812: havoc main_~node4____CPAchecker_TMP_0~7#1;havoc main_~node4__m4~15#1; [2025-02-07 21:22:36,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746: havoc main_~main____CPAchecker_TMP_0~13#1;havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~27#1; [2025-02-07 21:22:36,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L434: havoc main_~node3__m3~2#1; [2025-02-07 21:22:36,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1293: havoc main_~node3__m3~4#1; [2025-02-07 21:22:36,591 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2516: havoc main_~main____CPAchecker_TMP_0~10#1;havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~24#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L568: havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L403: havoc main_~node1__m1~2#1;havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2386: havoc main_~main____CPAchecker_TMP_0~9#1;havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~23#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L504: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2156: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~20#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2586: havoc main_~main____CPAchecker_TMP_0~11#1;havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~25#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3016: havoc main_~main____CPAchecker_TMP_0~16#1;havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~30#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L836: havoc main_~node4__m4~3#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L704: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2455: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1399: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2025-02-07 21:22:36,592 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003: havoc main_~node4__m4~4#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2226: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~21#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: havoc main_~check__tmp~9#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1136: havoc main_~node4__m4~5#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1170: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L3086: havoc main_~main____CPAchecker_TMP_0~17#1;havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~31#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2095: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: havoc main_~node3__m3~5#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L345: havoc main_~node4__m4~1#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2856: havoc main_~main____CPAchecker_TMP_0~14#1;havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~28#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L247: havoc main_~node4____CPAchecker_TMP_0~0#1;havoc main_~node4__m4~0#1; [2025-02-07 21:22:36,593 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1932: havoc main_~node4____CPAchecker_TMP_0~2#1;havoc main_~node4__m4~10#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L315: havoc main_~node2__m2~1#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2926: havoc main_~main____CPAchecker_TMP_0~15#1;havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~29#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L878: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node4__m4~2#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1308: havoc main_~node4__m4~6#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2795: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1045: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1442: havoc main_~node4__m4~7#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2632: havoc main_~node4____CPAchecker_TMP_0~6#1;havoc main_~node4__m4~14#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1509: havoc main_~check__tmp~13#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1476: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L419: havoc main_~node2__m2~2#1; [2025-02-07 21:22:36,594 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1278: havoc main_~node2__m2~3#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2272: havoc main_~node4____CPAchecker_TMP_0~4#1;havoc main_~node4__m4~12#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1711: havoc main_~check__tmp~16#1;havoc main_~node4__m4~9#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2438: havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1976: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~18#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2472: havoc main_~node4____CPAchecker_TMP_0~5#1;havoc main_~node4__m4~13#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L788: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1350: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1648: havoc main_~check__tmp~15#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1582: havoc main_~node4__m4~8#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L988: havoc main_~node3__m3~3#1; [2025-02-07 21:22:36,595 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L658: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-07 21:22:36,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1616: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~14#1; [2025-02-07 21:22:36,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1;#t~ret21#1 := main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_~main____CPAchecker_TMP_0~2#1, main_~__tmp_3~0#1, main_~assert__arg~2#1, main_~check__tmp~2#1, main_~node4____CPAchecker_TMP_0~1#1, main_~node4__m4~2#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node3__m3~2#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node2__m2~2#1, main_~node1____CPAchecker_TMP_0~1#1, main_~node1__m1~2#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_4~0#1, main_~assert__arg~3#1, main_~check__tmp~3#1, main_~node4__m4~1#1, main_~__tmp_5~0#1, main_~assert__arg~4#1, main_~check__tmp~4#1, main_~__tmp_6~0#1, main_~assert__arg~5#1, main_~check__tmp~5#1, main_~node4__m4~3#1, main_~node3__m3~1#1, main_~__tmp_7~0#1, main_~assert__arg~6#1, main_~check__tmp~6#1, main_~__tmp_8~0#1, main_~assert__arg~7#1, main_~check__tmp~7#1, main_~node4__m4~4#1, main_~__tmp_9~0#1, main_~assert__arg~8#1, main_~check__tmp~8#1, main_~check__tmp~9#1, main_~node4__m4~5#1, main_~node3__m3~3#1, main_~node2__m2~1#1, main_~__tmp_10~0#1, main_~assert__arg~9#1, main_~check__tmp~10#1, main_~__tmp_11~0#1, main_~assert__arg~10#1, main_~check__tmp~11#1, main_~node4__m4~6#1, main_~__tmp_12~0#1, main_~assert__arg~11#1, main_~check__tmp~12#1, main_~check__tmp~13#1, main_~node4__m4~7#1, main_~node3__m3~4#1, main_~__tmp_13~0#1, main_~assert__arg~12#1, main_~check__tmp~14#1, main_~check__tmp~15#1, main_~node4__m4~8#1, main_~check__tmp~16#1, main_~node4__m4~9#1, main_~node3__m3~5#1, main_~node2__m2~3#1, main_~node1__m1~1#1, main_~main____CPAchecker_TMP_0~0#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~main____CPAchecker_TMP_0~3#1, main_~__tmp_14~0#1, main_~assert__arg~13#1, main_~check__tmp~17#1, main_~node4____CPAchecker_TMP_0~0#1, main_~node4__m4~0#1, main_~main____CPAchecker_TMP_0~4#1, main_~__tmp_15~0#1, main_~assert__arg~14#1, main_~check__tmp~18#1, main_~main____CPAchecker_TMP_0~5#1, main_~__tmp_16~0#1, main_~assert__arg~15#1, main_~check__tmp~19#1, main_~node4____CPAchecker_TMP_0~2#1, main_~node4__m4~10#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node3__m3~0#1, main_~main____CPAchecker_TMP_0~6#1, main_~__tmp_17~0#1, main_~assert__arg~16#1, main_~check__tmp~20#1, main_~main____CPAchecker_TMP_0~7#1, main_~__tmp_18~0#1, main_~assert__arg~17#1, main_~check__tmp~21#1, main_~node4____CPAchecker_TMP_0~3#1, main_~node4__m4~11#1, main_~main____CPAchecker_TMP_0~8#1, main_~__tmp_19~0#1, main_~assert__arg~18#1, main_~check__tmp~22#1, main_~main____CPAchecker_TMP_0~9#1, main_~__tmp_20~0#1, main_~assert__arg~19#1, main_~check__tmp~23#1, main_~node4____CPAchecker_TMP_0~4#1, main_~node4__m4~12#1, main_~node3____CPAchecker_TMP_0~2#1, main_~node3__m3~6#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node2__m2~0#1, main_~main____CPAchecker_TMP_0~10#1, main_~__tmp_21~0#1, main_~assert__arg~20#1, main_~check__tmp~24#1, main_~main____CPAchecker_TMP_0~11#1, main_~__tmp_22~0#1, main_~assert__arg~21#1, main_~check__tmp~25#1, main_~node4____CPAchecker_TMP_0~5#1, main_~node4__m4~13#1, main_~main____CPAchecker_TMP_0~12#1, main_~__tmp_23~0#1, main_~assert__arg~22#1, main_~check__tmp~26#1, main_~main____CPAchecker_TMP_0~13#1, main_~__tmp_24~0#1, main_~assert__arg~23#1, main_~check__tmp~27#1, main_~node4____CPAchecker_TMP_0~6#1, main_~node4__m4~14#1, main_~node3____CPAchecker_TMP_0~3#1, main_~node3__m3~7#1, main_~main____CPAchecker_TMP_0~14#1, main_~__tmp_25~0#1, main_~assert__arg~24#1, main_~check__tmp~28#1, main_~main____CPAchecker_TMP_0~15#1, main_~__tmp_26~0#1, main_~assert__arg~25#1, main_~check__tmp~29#1, main_~node4____CPAchecker_TMP_0~7#1, main_~node4__m4~15#1, main_~main____CPAchecker_TMP_0~16#1, main_~__tmp_27~0#1, main_~assert__arg~26#1, main_~check__tmp~30#1, main_~main____CPAchecker_TMP_0~17#1, main_~__tmp_28~0#1, main_~assert__arg~27#1, main_~check__tmp~31#1, main_~node4____CPAchecker_TMP_0~8#1, main_~node4__m4~16#1, main_~node3____CPAchecker_TMP_0~4#1, main_~node3__m3~8#1, main_~node2____CPAchecker_TMP_0~2#1, main_~node2__m2~4#1, main_~node1____CPAchecker_TMP_0~0#1, main_~node1__m1~0#1, main_~init__tmp~0#1, main_~main__c1~0#1, main_~main__i2~0#1;assume { :end_inline_main } true; [2025-02-07 21:22:36,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2112: havoc main_~node4____CPAchecker_TMP_0~3#1;havoc main_~node4__m4~11#1; [2025-02-07 21:22:36,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2046: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~19#1; [2025-02-07 21:22:36,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L230: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1; [2025-02-07 21:22:36,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2972: havoc main_~node4____CPAchecker_TMP_0~8#1;havoc main_~node4__m4~16#1; [2025-02-07 21:22:36,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: havoc main_~node3__m3~1#1; [2025-02-07 21:22:36,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L2676: havoc main_~main____CPAchecker_TMP_0~12#1;havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~26#1; [2025-02-07 21:22:36,596 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: havoc main_~node1__m1~1#1;havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-07 21:22:36,724 INFO L? ?]: Removed 533 outVars from TransFormulas that were not future-live. [2025-02-07 21:22:36,725 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:22:36,742 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:22:36,743 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:22:36,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:36 BoogieIcfgContainer [2025-02-07 21:22:36,743 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:22:36,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:22:36,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:22:36,748 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:22:36,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:22:34" (1/3) ... [2025-02-07 21:22:36,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654faae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:22:36, skipping insertion in model container [2025-02-07 21:22:36,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:22:35" (2/3) ... [2025-02-07 21:22:36,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@654faae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:22:36, skipping insertion in model container [2025-02-07 21:22:36,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:36" (3/3) ... [2025-02-07 21:22:36,750 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c [2025-02-07 21:22:36,761 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:22:36,767 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c.v+lhb-reducer.c that has 1 procedures, 359 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-02-07 21:22:36,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:22:36,817 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;@3f334bff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:22:36,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-02-07 21:22:36,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 358 states, 291 states have (on average 1.9965635738831615) internal successors, (581), 357 states have internal predecessors, (581), 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) [2025-02-07 21:22:36,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 21:22:36,826 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:36,826 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:36,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:36,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1019416199, now seen corresponding path program 1 times [2025-02-07 21:22:36,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:36,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650116514] [2025-02-07 21:22:36,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:36,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:36,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-07 21:22:37,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 21:22:37,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:37,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:22:37,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:37,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650116514] [2025-02-07 21:22:37,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650116514] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:37,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:37,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-07 21:22:37,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825920482] [2025-02-07 21:22:37,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:37,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 21:22:37,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:38,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 21:22:38,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-07 21:22:38,005 INFO L87 Difference]: Start difference. First operand has 358 states, 291 states have (on average 1.9965635738831615) internal successors, (581), 357 states have internal predecessors, (581), 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 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 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) [2025-02-07 21:22:38,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:38,553 INFO L93 Difference]: Finished difference Result 370 states and 581 transitions. [2025-02-07 21:22:38,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 21:22:38,559 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 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 61 [2025-02-07 21:22:38,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:38,564 INFO L225 Difference]: With dead ends: 370 [2025-02-07 21:22:38,568 INFO L226 Difference]: Without dead ends: 128 [2025-02-07 21:22:38,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2025-02-07 21:22:38,575 INFO L435 NwaCegarLoop]: 410 mSDtfsCounter, 1906 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1906 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:38,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1906 Valid, 1424 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:22:38,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-07 21:22:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-02-07 21:22:38,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 121 states have (on average 1.0495867768595042) internal successors, (127), 127 states have internal predecessors, (127), 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) [2025-02-07 21:22:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 127 transitions. [2025-02-07 21:22:38,600 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 127 transitions. Word has length 61 [2025-02-07 21:22:38,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:38,600 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 127 transitions. [2025-02-07 21:22:38,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 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) [2025-02-07 21:22:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 127 transitions. [2025-02-07 21:22:38,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 21:22:38,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:38,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:38,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:22:38,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:38,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:38,602 INFO L85 PathProgramCache]: Analyzing trace with hash 738134984, now seen corresponding path program 1 times [2025-02-07 21:22:38,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:38,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814614935] [2025-02-07 21:22:38,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:38,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:38,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-07 21:22:38,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 21:22:38,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:38,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:22:39,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:39,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814614935] [2025-02-07 21:22:39,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814614935] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:39,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:39,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:22:39,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732361799] [2025-02-07 21:22:39,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:39,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:22:39,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:39,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:22:39,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:22:39,283 INFO L87 Difference]: Start difference. First operand 128 states and 127 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 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) [2025-02-07 21:22:39,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:39,759 INFO L93 Difference]: Finished difference Result 128 states and 127 transitions. [2025-02-07 21:22:39,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:22:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 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 61 [2025-02-07 21:22:39,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:39,760 INFO L225 Difference]: With dead ends: 128 [2025-02-07 21:22:39,760 INFO L226 Difference]: Without dead ends: 123 [2025-02-07 21:22:39,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:39,761 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 284 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:39,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 728 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:22:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-07 21:22:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-02-07 21:22:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 122 states have internal predecessors, (122), 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) [2025-02-07 21:22:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 122 transitions. [2025-02-07 21:22:39,765 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 122 transitions. Word has length 61 [2025-02-07 21:22:39,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:39,766 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 122 transitions. [2025-02-07 21:22:39,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 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) [2025-02-07 21:22:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 122 transitions. [2025-02-07 21:22:39,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 21:22:39,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:39,767 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:39,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:22:39,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:39,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:39,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1409499722, now seen corresponding path program 1 times [2025-02-07 21:22:39,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:39,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15568127] [2025-02-07 21:22:39,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:39,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:39,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-07 21:22:39,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 21:22:39,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:39,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:22:40,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:40,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15568127] [2025-02-07 21:22:40,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15568127] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:40,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:40,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:22:40,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324011564] [2025-02-07 21:22:40,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:40,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:22:40,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:40,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:22:40,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:22:40,311 INFO L87 Difference]: Start difference. First operand 123 states and 122 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 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) [2025-02-07 21:22:40,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:40,665 INFO L93 Difference]: Finished difference Result 123 states and 122 transitions. [2025-02-07 21:22:40,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-07 21:22:40,665 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 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 61 [2025-02-07 21:22:40,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:40,666 INFO L225 Difference]: With dead ends: 123 [2025-02-07 21:22:40,666 INFO L226 Difference]: Without dead ends: 118 [2025-02-07 21:22:40,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:40,667 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 279 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:40,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 689 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:22:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-02-07 21:22:40,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-02-07 21:22:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 117 states have internal predecessors, (117), 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) [2025-02-07 21:22:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 117 transitions. [2025-02-07 21:22:40,671 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 117 transitions. Word has length 61 [2025-02-07 21:22:40,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:40,671 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 117 transitions. [2025-02-07 21:22:40,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 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) [2025-02-07 21:22:40,671 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 117 transitions. [2025-02-07 21:22:40,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-07 21:22:40,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:40,672 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:40,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 21:22:40,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:40,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:40,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1065732276, now seen corresponding path program 1 times [2025-02-07 21:22:40,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:40,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885892077] [2025-02-07 21:22:40,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:40,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:40,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-07 21:22:40,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-07 21:22:40,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:40,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:41,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:22:41,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:41,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885892077] [2025-02-07 21:22:41,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885892077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:41,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:41,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-07 21:22:41,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607047505] [2025-02-07 21:22:41,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:41,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 21:22:41,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:41,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 21:22:41,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:41,666 INFO L87 Difference]: Start difference. First operand 118 states and 117 transitions. Second operand has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 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) [2025-02-07 21:22:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:42,502 INFO L93 Difference]: Finished difference Result 118 states and 117 transitions. [2025-02-07 21:22:42,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 21:22:42,504 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 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 61 [2025-02-07 21:22:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:42,505 INFO L225 Difference]: With dead ends: 118 [2025-02-07 21:22:42,505 INFO L226 Difference]: Without dead ends: 110 [2025-02-07 21:22:42,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2025-02-07 21:22:42,506 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 266 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:42,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 958 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 21:22:42,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-02-07 21:22:42,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-02-07 21:22:42,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 106 states have (on average 1.028301886792453) internal successors, (109), 109 states have internal predecessors, (109), 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) [2025-02-07 21:22:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 109 transitions. [2025-02-07 21:22:42,513 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 109 transitions. Word has length 61 [2025-02-07 21:22:42,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:42,515 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 109 transitions. [2025-02-07 21:22:42,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.652173913043478) internal successors, (61), 22 states have internal predecessors, (61), 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) [2025-02-07 21:22:42,515 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 109 transitions. [2025-02-07 21:22:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-07 21:22:42,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:42,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:42,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:22:42,516 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:42,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:42,516 INFO L85 PathProgramCache]: Analyzing trace with hash 934936524, now seen corresponding path program 1 times [2025-02-07 21:22:42,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:42,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596328606] [2025-02-07 21:22:42,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:42,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:42,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-07 21:22:42,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-07 21:22:42,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:42,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:22:43,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:43,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596328606] [2025-02-07 21:22:43,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596328606] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:43,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:43,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-07 21:22:43,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496814613] [2025-02-07 21:22:43,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:43,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 21:22:43,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:43,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 21:22:43,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:43,580 INFO L87 Difference]: Start difference. First operand 110 states and 109 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 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) [2025-02-07 21:22:45,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:45,099 INFO L93 Difference]: Finished difference Result 110 states and 109 transitions. [2025-02-07 21:22:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 21:22:45,099 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 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 62 [2025-02-07 21:22:45,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:45,100 INFO L225 Difference]: With dead ends: 110 [2025-02-07 21:22:45,100 INFO L226 Difference]: Without dead ends: 100 [2025-02-07 21:22:45,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=281, Invalid=1359, Unknown=0, NotChecked=0, Total=1640 [2025-02-07 21:22:45,102 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 331 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:45,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 745 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:22:45,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-07 21:22:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-07 21:22:45,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 99 states have internal predecessors, (99), 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) [2025-02-07 21:22:45,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 99 transitions. [2025-02-07 21:22:45,106 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 99 transitions. Word has length 62 [2025-02-07 21:22:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:45,106 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 99 transitions. [2025-02-07 21:22:45,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 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) [2025-02-07 21:22:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 99 transitions. [2025-02-07 21:22:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-07 21:22:45,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:45,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:45,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-07 21:22:45,108 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:45,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash 490939082, now seen corresponding path program 1 times [2025-02-07 21:22:45,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:45,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176835241] [2025-02-07 21:22:45,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:45,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:45,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-07 21:22:45,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-07 21:22:45,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:45,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:22:45,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:45,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176835241] [2025-02-07 21:22:45,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176835241] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:45,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:45,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2025-02-07 21:22:45,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000284042] [2025-02-07 21:22:45,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:45,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 21:22:45,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:45,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 21:22:45,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:45,863 INFO L87 Difference]: Start difference. First operand 100 states and 99 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 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) [2025-02-07 21:22:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:46,576 INFO L93 Difference]: Finished difference Result 100 states and 99 transitions. [2025-02-07 21:22:46,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-07 21:22:46,576 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 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 62 [2025-02-07 21:22:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:46,577 INFO L225 Difference]: With dead ends: 100 [2025-02-07 21:22:46,578 INFO L226 Difference]: Without dead ends: 93 [2025-02-07 21:22:46,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=1295, Unknown=0, NotChecked=0, Total=1560 [2025-02-07 21:22:46,579 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 289 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:46,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 647 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 21:22:46,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-02-07 21:22:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-02-07 21:22:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.010989010989011) internal successors, (92), 92 states have internal predecessors, (92), 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) [2025-02-07 21:22:46,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 92 transitions. [2025-02-07 21:22:46,585 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 92 transitions. Word has length 62 [2025-02-07 21:22:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:46,585 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 92 transitions. [2025-02-07 21:22:46,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 22 states have internal predecessors, (62), 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) [2025-02-07 21:22:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 92 transitions. [2025-02-07 21:22:46,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-07 21:22:46,586 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:46,586 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:46,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:22:46,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:46,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash 272406976, now seen corresponding path program 1 times [2025-02-07 21:22:46,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:46,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389839906] [2025-02-07 21:22:46,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:46,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:46,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-07 21:22:46,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-07 21:22:46,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:46,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:46,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:22:46,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:46,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389839906] [2025-02-07 21:22:46,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389839906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:46,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:46,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-07 21:22:46,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113002589] [2025-02-07 21:22:46,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:46,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-07 21:22:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:46,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-07 21:22:46,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:22:46,924 INFO L87 Difference]: Start difference. First operand 93 states and 92 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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) [2025-02-07 21:22:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:47,491 INFO L93 Difference]: Finished difference Result 93 states and 92 transitions. [2025-02-07 21:22:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-07 21:22:47,492 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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 62 [2025-02-07 21:22:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:47,492 INFO L225 Difference]: With dead ends: 93 [2025-02-07 21:22:47,492 INFO L226 Difference]: Without dead ends: 80 [2025-02-07 21:22:47,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2025-02-07 21:22:47,493 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 207 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:47,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 446 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 21:22:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-07 21:22:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-07 21:22:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0) internal successors, (79), 79 states have internal predecessors, (79), 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) [2025-02-07 21:22:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 79 transitions. [2025-02-07 21:22:47,496 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 79 transitions. Word has length 62 [2025-02-07 21:22:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:47,496 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 79 transitions. [2025-02-07 21:22:47,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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) [2025-02-07 21:22:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 79 transitions. [2025-02-07 21:22:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-07 21:22:47,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:22:47,497 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:47,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:22:47,497 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2025-02-07 21:22:47,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:22:47,497 INFO L85 PathProgramCache]: Analyzing trace with hash 918749289, now seen corresponding path program 1 times [2025-02-07 21:22:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:22:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566895364] [2025-02-07 21:22:47,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:22:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:22:47,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 21:22:47,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 21:22:47,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:22:47,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:22:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 21:22:47,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:22:47,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566895364] [2025-02-07 21:22:47,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566895364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:22:47,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:22:47,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:22:47,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733346819] [2025-02-07 21:22:47,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:22:47,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:22:47,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:22:47,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:22:47,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:22:47,537 INFO L87 Difference]: Start difference. First operand 80 states and 79 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2025-02-07 21:22:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:22:47,546 INFO L93 Difference]: Finished difference Result 80 states and 79 transitions. [2025-02-07 21:22:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:22:47,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-02-07 21:22:47,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:22:47,547 INFO L225 Difference]: With dead ends: 80 [2025-02-07 21:22:47,547 INFO L226 Difference]: Without dead ends: 0 [2025-02-07 21:22:47,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:22:47,548 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:22:47,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:22:47,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-07 21:22:47,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-07 21:22:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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) [2025-02-07 21:22:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-07 21:22:47,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2025-02-07 21:22:47,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:22:47,548 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-07 21:22:47,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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) [2025-02-07 21:22:47,548 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-07 21:22:47,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-07 21:22:47,550 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2025-02-07 21:22:47,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (9 of 11 remaining) [2025-02-07 21:22:47,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2025-02-07 21:22:47,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 11 remaining) [2025-02-07 21:22:47,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 11 remaining) [2025-02-07 21:22:47,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (5 of 11 remaining) [2025-02-07 21:22:47,551 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (4 of 11 remaining) [2025-02-07 21:22:47,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2025-02-07 21:22:47,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (2 of 11 remaining) [2025-02-07 21:22:47,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2025-02-07 21:22:47,552 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (0 of 11 remaining) [2025-02-07 21:22:47,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-07 21:22:47,554 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:22:47,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-07 21:22:47,559 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 21:22:47,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 09:22:47 BoogieIcfgContainer [2025-02-07 21:22:47,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 21:22:47,564 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 21:22:47,564 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 21:22:47,564 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 21:22:47,565 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:22:36" (3/4) ... [2025-02-07 21:22:47,566 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-07 21:22:47,583 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-07 21:22:47,585 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-07 21:22:47,587 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-07 21:22:47,588 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-07 21:22:47,693 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 21:22:47,693 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 21:22:47,693 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 21:22:47,694 INFO L158 Benchmark]: Toolchain (without parser) took 13122.95ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 130.7MB in the beginning and 227.5MB in the end (delta: -96.7MB). Peak memory consumption was 76.6MB. Max. memory is 16.1GB. [2025-02-07 21:22:47,694 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:22:47,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.36ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 92.2MB in the end (delta: 38.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-07 21:22:47,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.45ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 84.9MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 21:22:47,695 INFO L158 Benchmark]: Boogie Preprocessor took 95.67ms. Allocated memory is still 167.8MB. Free memory was 84.9MB in the beginning and 78.4MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 21:22:47,696 INFO L158 Benchmark]: IcfgBuilder took 1449.68ms. Allocated memory is still 167.8MB. Free memory was 77.8MB in the beginning and 112.3MB in the end (delta: -34.5MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2025-02-07 21:22:47,696 INFO L158 Benchmark]: TraceAbstraction took 10818.77ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 111.0MB in the beginning and 248.8MB in the end (delta: -137.8MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2025-02-07 21:22:47,696 INFO L158 Benchmark]: Witness Printer took 129.34ms. Allocated memory is still 343.9MB. Free memory was 248.8MB in the beginning and 227.5MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-07 21:22:47,697 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 226.5MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.36ms. Allocated memory is still 167.8MB. Free memory was 130.7MB in the beginning and 92.2MB in the end (delta: 38.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.45ms. Allocated memory is still 167.8MB. Free memory was 92.2MB in the beginning and 84.9MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.67ms. Allocated memory is still 167.8MB. Free memory was 84.9MB in the beginning and 78.4MB in the end (delta: 6.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1449.68ms. Allocated memory is still 167.8MB. Free memory was 77.8MB in the beginning and 112.3MB in the end (delta: -34.5MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10818.77ms. Allocated memory was 167.8MB in the beginning and 343.9MB in the end (delta: 176.2MB). Free memory was 111.0MB in the beginning and 248.8MB in the end (delta: -137.8MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. * Witness Printer took 129.34ms. Allocated memory is still 343.9MB. Free memory was 248.8MB in the beginning and 227.5MB in the end (delta: 21.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 500]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 795]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 885]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 934]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1052]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1101]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1177]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1357]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1406]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1483]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1623]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 359 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3562 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3562 mSDsluCounter, 5780 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4850 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2753 IncrementalHoareTripleChecker+Invalid, 2771 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 930 mSDtfsCounter, 2753 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=0, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 509 NumberOfCodeBlocks, 509 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 9423 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-07 21:22:47,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE