./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c5409edee222b3f26bc580399bcb562d4fe1c01c7706a6bada265380f08e33c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:21:52,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:21:52,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:21:52,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:21:52,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:21:52,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:21:52,147 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:21:52,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:21:52,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:21:52,147 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:21:52,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:21:52,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:21:52,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:21:52,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:21:52,149 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:21:52,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:21:52,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:21:52,149 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:21:52,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:21:52,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:21:52,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:21:52,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:21:52,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:21:52,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:21:52,150 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:21:52,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:21:52,150 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:21:52,150 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:21:52,150 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:21:52,150 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:21:52,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:21:52,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:21:52,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:52,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:21:52,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:21:52,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:21:52,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:21:52,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:21:52,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:21:52,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:21:52,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:21:52,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:21:52,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:21:52,152 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/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 -> 5c5409edee222b3f26bc580399bcb562d4fe1c01c7706a6bada265380f08e33c [2025-03-17 05:21:52,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:21:52,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:21:52,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:21:52,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:21:52,424 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:21:52,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2025-03-17 05:21:53,657 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c870b3dd/4e09d5c3df154e8b9f409148a77c4c7c/FLAG907f14a25 [2025-03-17 05:21:53,900 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:21:53,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2025-03-17 05:21:53,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c870b3dd/4e09d5c3df154e8b9f409148a77c4c7c/FLAG907f14a25 [2025-03-17 05:21:53,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c870b3dd/4e09d5c3df154e8b9f409148a77c4c7c [2025-03-17 05:21:53,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:21:53,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:21:53,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:21:53,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:21:53,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:21:53,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:21:53" (1/1) ... [2025-03-17 05:21:53,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55326951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:53, skipping insertion in model container [2025-03-17 05:21:53,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:21:53" (1/1) ... [2025-03-17 05:21:53,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:21:54,092 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2025-03-17 05:21:54,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:21:54,170 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:21:54,180 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2025-03-17 05:21:54,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:21:54,229 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:21:54,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54 WrapperNode [2025-03-17 05:21:54,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:21:54,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:21:54,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:21:54,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:21:54,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,272 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 626 [2025-03-17 05:21:54,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:21:54,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:21:54,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:21:54,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:21:54,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,309 INFO L175 MemorySlicer]: Split 151 memory accesses to 4 slices as follows [2, 31, 75, 43]. 50 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 17 writes are split as follows [0, 5, 6, 6]. [2025-03-17 05:21:54,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,332 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:21:54,341 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:21:54,341 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:21:54,342 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:21:54,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (1/1) ... [2025-03-17 05:21:54,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:54,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:54,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:21:54,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:21:54,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:21:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:21:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:21:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:21:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:21:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:21:54,395 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:21:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:21:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:21:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:21:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:21:54,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:21:54,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:21:54,520 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:21:54,522 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:21:55,048 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~ite115#1;havoc property_#t~ite114#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short112#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem126#1;havoc property_#t~mem120#1;havoc property_#t~ite123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite140#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~short141#1;havoc property_#t~mem142#1;havoc property_#t~ite179#1;havoc property_#t~mem176#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite151#1;havoc property_#t~mem150#1;havoc property_#t~ite158#1;havoc property_#t~mem152#1;havoc property_#t~ite154#1;havoc property_#t~mem153#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~ite175#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite163#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~ite167#1;havoc property_#t~mem166#1;havoc property_#t~ite174#1;havoc property_#t~mem168#1;havoc property_#t~ite170#1;havoc property_#t~mem169#1;havoc property_#t~mem171#1;havoc property_#t~ite173#1;havoc property_#t~mem172#1;havoc property_#t~mem178#1;havoc property_#t~mem177#1;havoc property_#t~short180#1; [2025-03-17 05:21:55,116 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-03-17 05:21:55,116 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:21:55,127 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:21:55,127 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:21:55,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:55 BoogieIcfgContainer [2025-03-17 05:21:55,128 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:21:55,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:21:55,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:21:55,133 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:21:55,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:21:53" (1/3) ... [2025-03-17 05:21:55,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e41aae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:55, skipping insertion in model container [2025-03-17 05:21:55,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:54" (2/3) ... [2025-03-17 05:21:55,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e41aae5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:55, skipping insertion in model container [2025-03-17 05:21:55,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:55" (3/3) ... [2025-03-17 05:21:55,136 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-3.i [2025-03-17 05:21:55,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:21:55,150 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-3.i that has 2 procedures, 143 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:21:55,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:21:55,204 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;@4c77fe6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:21:55,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:21:55,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 124 states have (on average 1.4758064516129032) internal successors, (183), 125 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:21:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:21:55,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:55,219 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:21:55,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:55,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:55,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1476816455, now seen corresponding path program 1 times [2025-03-17 05:21:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:55,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070775205] [2025-03-17 05:21:55,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:55,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:55,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:21:55,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:21:55,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:55,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:55,512 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:21:55,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:55,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070775205] [2025-03-17 05:21:55,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070775205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:55,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270626654] [2025-03-17 05:21:55,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:55,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:55,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:55,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:21:55,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:21:55,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:21:55,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:21:55,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:55,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:55,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:21:55,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-17 05:21:55,763 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270626654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:55,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:55,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:21:55,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227838164] [2025-03-17 05:21:55,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:55,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:21:55,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:55,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:21:55,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:21:55,787 INFO L87 Difference]: Start difference. First operand has 143 states, 124 states have (on average 1.4758064516129032) internal successors, (183), 125 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:21:55,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:55,810 INFO L93 Difference]: Finished difference Result 283 states and 444 transitions. [2025-03-17 05:21:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:21:55,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-17 05:21:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:55,818 INFO L225 Difference]: With dead ends: 283 [2025-03-17 05:21:55,818 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 05:21:55,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:21:55,823 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:55,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:55,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 05:21:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-17 05:21:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4552845528455285) internal successors, (179), 123 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:21:55,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2025-03-17 05:21:55,859 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 129 [2025-03-17 05:21:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:55,859 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2025-03-17 05:21:55,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:21:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2025-03-17 05:21:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:21:55,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:55,863 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:21:55,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:21:56,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:21:56,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:56,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:56,071 INFO L85 PathProgramCache]: Analyzing trace with hash 433266565, now seen corresponding path program 1 times [2025-03-17 05:21:56,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:56,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077261589] [2025-03-17 05:21:56,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:56,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:56,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:21:56,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:21:56,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:56,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:21:56,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:56,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077261589] [2025-03-17 05:21:56,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077261589] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:56,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184331355] [2025-03-17 05:21:56,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:56,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:56,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:56,460 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:21:56,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:21:56,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:21:56,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:21:56,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:56,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:56,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:21:56,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:21:56,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:56,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184331355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:56,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:56,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:21:56,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727070611] [2025-03-17 05:21:56,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:56,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:21:56,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:56,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:21:56,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:21:56,724 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:21:56,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:56,787 INFO L93 Difference]: Finished difference Result 283 states and 424 transitions. [2025-03-17 05:21:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:21:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-17 05:21:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:56,790 INFO L225 Difference]: With dead ends: 283 [2025-03-17 05:21:56,790 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 05:21:56,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:21:56,792 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:56,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 616 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 05:21:56,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-17 05:21:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 125 states have (on average 1.448) internal successors, (181), 125 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:21:56,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2025-03-17 05:21:56,803 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 129 [2025-03-17 05:21:56,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:56,804 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2025-03-17 05:21:56,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:21:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2025-03-17 05:21:56,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:21:56,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:56,806 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:21:56,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:21:57,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 05:21:57,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:57,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:57,008 INFO L85 PathProgramCache]: Analyzing trace with hash 111249123, now seen corresponding path program 1 times [2025-03-17 05:21:57,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:57,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050937039] [2025-03-17 05:21:57,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:57,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:57,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:21:57,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:21:57,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:57,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:21:57,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:57,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050937039] [2025-03-17 05:21:57,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050937039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:57,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:57,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:21:57,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333067518] [2025-03-17 05:21:57,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:57,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:21:57,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:57,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:21:57,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:21:57,441 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:21:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:57,575 INFO L93 Difference]: Finished difference Result 427 states and 637 transitions. [2025-03-17 05:21:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:21:57,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2025-03-17 05:21:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:57,579 INFO L225 Difference]: With dead ends: 427 [2025-03-17 05:21:57,580 INFO L226 Difference]: Without dead ends: 285 [2025-03-17 05:21:57,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:21:57,582 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 158 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:57,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 776 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:21:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-17 05:21:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 280. [2025-03-17 05:21:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 245 states have (on average 1.4448979591836735) internal successors, (354), 245 states have internal predecessors, (354), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:21:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 418 transitions. [2025-03-17 05:21:57,601 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 418 transitions. Word has length 131 [2025-03-17 05:21:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:57,601 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 418 transitions. [2025-03-17 05:21:57,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:21:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2025-03-17 05:21:57,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:21:57,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:57,607 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:21:57,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:21:57,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:57,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:57,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1933370771, now seen corresponding path program 1 times [2025-03-17 05:21:57,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:57,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716406213] [2025-03-17 05:21:57,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:57,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:57,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:21:57,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:21:57,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:57,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:58,761 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:21:58,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:58,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716406213] [2025-03-17 05:21:58,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716406213] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:58,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:58,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:21:58,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138289489] [2025-03-17 05:21:58,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:58,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:21:58,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:58,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:21:58,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:21:58,763 INFO L87 Difference]: Start difference. First operand 280 states and 418 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:21:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:59,038 INFO L93 Difference]: Finished difference Result 546 states and 813 transitions. [2025-03-17 05:21:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:21:59,039 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2025-03-17 05:21:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:59,042 INFO L225 Difference]: With dead ends: 546 [2025-03-17 05:21:59,042 INFO L226 Difference]: Without dead ends: 404 [2025-03-17 05:21:59,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:21:59,043 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 171 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:59,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1681 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:21:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-03-17 05:21:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2025-03-17 05:21:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 353 states have (on average 1.4447592067988668) internal successors, (510), 354 states have internal predecessors, (510), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:21:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 598 transitions. [2025-03-17 05:21:59,066 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 598 transitions. Word has length 132 [2025-03-17 05:21:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:59,067 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 598 transitions. [2025-03-17 05:21:59,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:21:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 598 transitions. [2025-03-17 05:21:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:21:59,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:59,069 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:21:59,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:21:59,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:59,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:59,070 INFO L85 PathProgramCache]: Analyzing trace with hash 175703409, now seen corresponding path program 1 times [2025-03-17 05:21:59,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:59,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896147901] [2025-03-17 05:21:59,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:59,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:59,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:21:59,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:21:59,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:59,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:21:59,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:59,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896147901] [2025-03-17 05:21:59,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896147901] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:59,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:59,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:21:59,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136998457] [2025-03-17 05:21:59,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:59,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:21:59,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:59,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:21:59,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:21:59,165 INFO L87 Difference]: Start difference. First operand 401 states and 598 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:21:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:59,201 INFO L93 Difference]: Finished difference Result 1019 states and 1521 transitions. [2025-03-17 05:21:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:21:59,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2025-03-17 05:21:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:59,207 INFO L225 Difference]: With dead ends: 1019 [2025-03-17 05:21:59,207 INFO L226 Difference]: Without dead ends: 619 [2025-03-17 05:21:59,208 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-03-17 05:21:59,209 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 111 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:59,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 449 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-17 05:21:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 485. [2025-03-17 05:21:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 437 states have (on average 1.4576659038901603) internal successors, (637), 438 states have internal predecessors, (637), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:21:59,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 725 transitions. [2025-03-17 05:21:59,240 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 725 transitions. Word has length 132 [2025-03-17 05:21:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:59,241 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 725 transitions. [2025-03-17 05:21:59,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:21:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 725 transitions. [2025-03-17 05:21:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:21:59,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:59,243 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:21:59,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:21:59,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:59,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash 246512087, now seen corresponding path program 1 times [2025-03-17 05:21:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:59,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050027209] [2025-03-17 05:21:59,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:59,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:21:59,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:21:59,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:59,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:59,394 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:21:59,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050027209] [2025-03-17 05:21:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050027209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131378829] [2025-03-17 05:21:59,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:59,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:59,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:59,397 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:21:59,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:21:59,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:21:59,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:21:59,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:59,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:59,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:21:59,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:21:59,614 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:59,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131378829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:59,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:59,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:21:59,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358568766] [2025-03-17 05:21:59,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:59,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:21:59,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:59,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:21:59,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:59,615 INFO L87 Difference]: Start difference. First operand 485 states and 725 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:21:59,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:59,652 INFO L93 Difference]: Finished difference Result 978 states and 1461 transitions. [2025-03-17 05:21:59,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:21:59,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-17 05:21:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:59,656 INFO L225 Difference]: With dead ends: 978 [2025-03-17 05:21:59,657 INFO L226 Difference]: Without dead ends: 494 [2025-03-17 05:21:59,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:59,658 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:59,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 817 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-17 05:21:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 488. [2025-03-17 05:21:59,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 440 states have (on average 1.4545454545454546) internal successors, (640), 441 states have internal predecessors, (640), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:21:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 728 transitions. [2025-03-17 05:21:59,684 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 728 transitions. Word has length 133 [2025-03-17 05:21:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:59,685 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 728 transitions. [2025-03-17 05:21:59,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:21:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 728 transitions. [2025-03-17 05:21:59,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:21:59,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:59,686 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:21:59,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:21:59,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:59,887 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:59,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:59,888 INFO L85 PathProgramCache]: Analyzing trace with hash 239453830, now seen corresponding path program 1 times [2025-03-17 05:21:59,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:59,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136409263] [2025-03-17 05:21:59,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:59,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:21:59,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:21:59,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:59,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:00,190 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:00,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:00,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136409263] [2025-03-17 05:22:00,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136409263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:00,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:00,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:00,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139805165] [2025-03-17 05:22:00,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:00,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:00,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:00,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:00,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:00,193 INFO L87 Difference]: Start difference. First operand 488 states and 728 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:00,395 INFO L93 Difference]: Finished difference Result 983 states and 1466 transitions. [2025-03-17 05:22:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-17 05:22:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:00,399 INFO L225 Difference]: With dead ends: 983 [2025-03-17 05:22:00,399 INFO L226 Difference]: Without dead ends: 496 [2025-03-17 05:22:00,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:00,401 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 148 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:00,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 919 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:00,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-03-17 05:22:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 488. [2025-03-17 05:22:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 440 states have (on average 1.4522727272727274) internal successors, (639), 441 states have internal predecessors, (639), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:22:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 727 transitions. [2025-03-17 05:22:00,426 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 727 transitions. Word has length 133 [2025-03-17 05:22:00,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:00,427 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 727 transitions. [2025-03-17 05:22:00,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:00,427 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 727 transitions. [2025-03-17 05:22:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:22:00,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:00,430 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:00,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:22:00,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:00,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:00,431 INFO L85 PathProgramCache]: Analyzing trace with hash 324326160, now seen corresponding path program 1 times [2025-03-17 05:22:00,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:00,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452866071] [2025-03-17 05:22:00,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:00,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:22:00,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:22:00,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:00,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:00,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:00,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452866071] [2025-03-17 05:22:00,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452866071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:00,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:00,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:00,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129202421] [2025-03-17 05:22:00,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:00,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:00,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:00,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:00,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:00,884 INFO L87 Difference]: Start difference. First operand 488 states and 727 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:01,249 INFO L93 Difference]: Finished difference Result 838 states and 1247 transitions. [2025-03-17 05:22:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:22:01,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-03-17 05:22:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:01,256 INFO L225 Difference]: With dead ends: 838 [2025-03-17 05:22:01,256 INFO L226 Difference]: Without dead ends: 518 [2025-03-17 05:22:01,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:01,258 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 395 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:01,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 915 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-03-17 05:22:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 510. [2025-03-17 05:22:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 457 states have (on average 1.4420131291028446) internal successors, (659), 457 states have internal predecessors, (659), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:22:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 755 transitions. [2025-03-17 05:22:01,292 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 755 transitions. Word has length 134 [2025-03-17 05:22:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:01,292 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 755 transitions. [2025-03-17 05:22:01,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 755 transitions. [2025-03-17 05:22:01,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:22:01,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:01,294 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:01,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:22:01,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:01,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:01,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1402252746, now seen corresponding path program 1 times [2025-03-17 05:22:01,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:01,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343612601] [2025-03-17 05:22:01,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:01,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:01,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:22:01,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:22:01,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:01,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:22:01,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:01,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343612601] [2025-03-17 05:22:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343612601] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:01,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713107296] [2025-03-17 05:22:01,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:01,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:01,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:01,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:22:01,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:22:01,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:22:01,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:22:01,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:01,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:01,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:22:01,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:01,608 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:01,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:01,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713107296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:01,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:01,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-17 05:22:01,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488736512] [2025-03-17 05:22:01,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:01,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:01,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:01,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:01,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:22:01,610 INFO L87 Difference]: Start difference. First operand 510 states and 755 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:01,639 INFO L93 Difference]: Finished difference Result 1028 states and 1521 transitions. [2025-03-17 05:22:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:01,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-03-17 05:22:01,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:01,642 INFO L225 Difference]: With dead ends: 1028 [2025-03-17 05:22:01,642 INFO L226 Difference]: Without dead ends: 519 [2025-03-17 05:22:01,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:22:01,643 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 0 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:01,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 816 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:01,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-03-17 05:22:01,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 519. [2025-03-17 05:22:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 466 states have (on average 1.4334763948497855) internal successors, (668), 466 states have internal predecessors, (668), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:22:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 764 transitions. [2025-03-17 05:22:01,680 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 764 transitions. Word has length 134 [2025-03-17 05:22:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:01,680 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 764 transitions. [2025-03-17 05:22:01,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:01,684 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 764 transitions. [2025-03-17 05:22:01,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:22:01,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:01,686 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:01,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:22:01,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:01,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:01,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:01,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1048299210, now seen corresponding path program 1 times [2025-03-17 05:22:01,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:01,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69952695] [2025-03-17 05:22:01,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:01,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:01,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:22:01,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:22:01,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:01,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:02,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:02,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69952695] [2025-03-17 05:22:02,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69952695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:02,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:02,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:02,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791241562] [2025-03-17 05:22:02,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:02,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:02,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:02,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:02,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:02,302 INFO L87 Difference]: Start difference. First operand 519 states and 764 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:02,533 INFO L93 Difference]: Finished difference Result 879 states and 1293 transitions. [2025-03-17 05:22:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:22:02,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2025-03-17 05:22:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:02,536 INFO L225 Difference]: With dead ends: 879 [2025-03-17 05:22:02,537 INFO L226 Difference]: Without dead ends: 531 [2025-03-17 05:22:02,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:22:02,539 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 458 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:02,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 946 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-17 05:22:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 353. [2025-03-17 05:22:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 317 states have (on average 1.4258675078864353) internal successors, (452), 317 states have internal predecessors, (452), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 516 transitions. [2025-03-17 05:22:02,559 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 516 transitions. Word has length 134 [2025-03-17 05:22:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:02,560 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 516 transitions. [2025-03-17 05:22:02,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 516 transitions. [2025-03-17 05:22:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:22:02,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:02,561 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:02,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:22:02,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:02,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1033020423, now seen corresponding path program 1 times [2025-03-17 05:22:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:02,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645573671] [2025-03-17 05:22:02,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:02,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:22:02,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:22:02,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:02,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:02,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645573671] [2025-03-17 05:22:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645573671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:22:02,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33577958] [2025-03-17 05:22:02,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:22:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:02,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:22:02,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:22:02,619 INFO L87 Difference]: Start difference. First operand 353 states and 516 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:02,644 INFO L93 Difference]: Finished difference Result 779 states and 1133 transitions. [2025-03-17 05:22:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:22:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2025-03-17 05:22:02,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:02,647 INFO L225 Difference]: With dead ends: 779 [2025-03-17 05:22:02,647 INFO L226 Difference]: Without dead ends: 427 [2025-03-17 05:22:02,647 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-03-17 05:22:02,648 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 104 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:02,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 502 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:02,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-17 05:22:02,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 337. [2025-03-17 05:22:02,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 301 states have (on average 1.4053156146179402) internal successors, (423), 301 states have internal predecessors, (423), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:02,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 487 transitions. [2025-03-17 05:22:02,664 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 487 transitions. Word has length 135 [2025-03-17 05:22:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:02,666 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 487 transitions. [2025-03-17 05:22:02,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:02,666 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 487 transitions. [2025-03-17 05:22:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:22:02,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:02,668 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:02,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:22:02,668 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:02,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash 262751043, now seen corresponding path program 1 times [2025-03-17 05:22:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36034641] [2025-03-17 05:22:02,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:02,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:02,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:22:02,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:22:02,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:02,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:03,631 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:03,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:03,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36034641] [2025-03-17 05:22:03,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36034641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:03,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:03,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:22:03,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178222947] [2025-03-17 05:22:03,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:03,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:22:03,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:03,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:22:03,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:22:03,633 INFO L87 Difference]: Start difference. First operand 337 states and 487 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:04,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:04,017 INFO L93 Difference]: Finished difference Result 814 states and 1176 transitions. [2025-03-17 05:22:04,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:22:04,018 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2025-03-17 05:22:04,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:04,021 INFO L225 Difference]: With dead ends: 814 [2025-03-17 05:22:04,021 INFO L226 Difference]: Without dead ends: 478 [2025-03-17 05:22:04,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:22:04,022 INFO L435 NwaCegarLoop]: 336 mSDtfsCounter, 156 mSDsluCounter, 2656 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:04,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 2992 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-17 05:22:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 475. [2025-03-17 05:22:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 430 states have (on average 1.4116279069767441) internal successors, (607), 431 states have internal predecessors, (607), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:22:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 687 transitions. [2025-03-17 05:22:04,050 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 687 transitions. Word has length 135 [2025-03-17 05:22:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:04,051 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 687 transitions. [2025-03-17 05:22:04,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 687 transitions. [2025-03-17 05:22:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:22:04,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:04,053 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:04,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:22:04,053 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:04,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:04,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1534200316, now seen corresponding path program 1 times [2025-03-17 05:22:04,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:04,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060473680] [2025-03-17 05:22:04,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:04,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:04,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:22:04,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:22:04,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:04,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:04,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:04,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060473680] [2025-03-17 05:22:04,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060473680] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:04,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:04,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:04,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806267186] [2025-03-17 05:22:04,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:04,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:04,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:04,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:04,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:04,382 INFO L87 Difference]: Start difference. First operand 475 states and 687 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:04,475 INFO L93 Difference]: Finished difference Result 988 states and 1429 transitions. [2025-03-17 05:22:04,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:04,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2025-03-17 05:22:04,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:04,479 INFO L225 Difference]: With dead ends: 988 [2025-03-17 05:22:04,479 INFO L226 Difference]: Without dead ends: 514 [2025-03-17 05:22:04,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:04,482 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 150 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:04,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 998 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:04,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-17 05:22:04,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 471. [2025-03-17 05:22:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 426 states have (on average 1.4107981220657277) internal successors, (601), 427 states have internal predecessors, (601), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:22:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 681 transitions. [2025-03-17 05:22:04,503 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 681 transitions. Word has length 135 [2025-03-17 05:22:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:04,503 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 681 transitions. [2025-03-17 05:22:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 681 transitions. [2025-03-17 05:22:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:22:04,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:04,506 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:22:04,507 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:04,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:04,507 INFO L85 PathProgramCache]: Analyzing trace with hash -146073182, now seen corresponding path program 1 times [2025-03-17 05:22:04,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:04,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377639323] [2025-03-17 05:22:04,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:04,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:04,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:22:04,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:22:04,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:04,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:04,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:04,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377639323] [2025-03-17 05:22:04,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377639323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:04,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:04,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:04,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989191102] [2025-03-17 05:22:04,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:04,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:04,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:04,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:04,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:04,777 INFO L87 Difference]: Start difference. First operand 471 states and 681 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:04,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:04,961 INFO L93 Difference]: Finished difference Result 948 states and 1366 transitions. [2025-03-17 05:22:04,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:04,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2025-03-17 05:22:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:04,965 INFO L225 Difference]: With dead ends: 948 [2025-03-17 05:22:04,965 INFO L226 Difference]: Without dead ends: 478 [2025-03-17 05:22:04,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:22:04,967 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 151 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:04,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1458 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-17 05:22:04,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 399. [2025-03-17 05:22:04,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 362 states have (on average 1.4005524861878453) internal successors, (507), 362 states have internal predecessors, (507), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 571 transitions. [2025-03-17 05:22:04,990 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 571 transitions. Word has length 135 [2025-03-17 05:22:04,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:04,990 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 571 transitions. [2025-03-17 05:22:04,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:04,990 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 571 transitions. [2025-03-17 05:22:04,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:22:04,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:04,992 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:04,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:22:04,992 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:04,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1943024541, now seen corresponding path program 1 times [2025-03-17 05:22:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151690564] [2025-03-17 05:22:04,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:05,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:22:05,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:22:05,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:05,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:05,906 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:05,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:05,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151690564] [2025-03-17 05:22:05,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151690564] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:05,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:22:05,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309928781] [2025-03-17 05:22:05,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:05,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:22:05,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:05,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:22:05,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:22:05,908 INFO L87 Difference]: Start difference. First operand 399 states and 571 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:06,309 INFO L93 Difference]: Finished difference Result 876 states and 1255 transitions. [2025-03-17 05:22:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:22:06,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2025-03-17 05:22:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:06,313 INFO L225 Difference]: With dead ends: 876 [2025-03-17 05:22:06,313 INFO L226 Difference]: Without dead ends: 478 [2025-03-17 05:22:06,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:22:06,315 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 150 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:06,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 3051 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:22:06,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-17 05:22:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 395. [2025-03-17 05:22:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 358 states have (on average 1.4022346368715084) internal successors, (502), 358 states have internal predecessors, (502), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 566 transitions. [2025-03-17 05:22:06,340 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 566 transitions. Word has length 135 [2025-03-17 05:22:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:06,341 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 566 transitions. [2025-03-17 05:22:06,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 566 transitions. [2025-03-17 05:22:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:22:06,343 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:06,343 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:06,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:22:06,343 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:06,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1853285900, now seen corresponding path program 1 times [2025-03-17 05:22:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:06,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783986597] [2025-03-17 05:22:06,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:06,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:22:06,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:22:06,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:06,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:07,115 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:07,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:07,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783986597] [2025-03-17 05:22:07,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783986597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:07,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:07,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:22:07,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309236673] [2025-03-17 05:22:07,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:07,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:22:07,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:07,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:22:07,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:22:07,119 INFO L87 Difference]: Start difference. First operand 395 states and 566 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:07,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:07,396 INFO L93 Difference]: Finished difference Result 1043 states and 1494 transitions. [2025-03-17 05:22:07,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:22:07,397 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2025-03-17 05:22:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:07,400 INFO L225 Difference]: With dead ends: 1043 [2025-03-17 05:22:07,400 INFO L226 Difference]: Without dead ends: 649 [2025-03-17 05:22:07,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:22:07,402 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 282 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:07,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1604 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2025-03-17 05:22:07,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 456. [2025-03-17 05:22:07,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 419 states have (on average 1.4105011933174225) internal successors, (591), 419 states have internal predecessors, (591), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 655 transitions. [2025-03-17 05:22:07,421 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 655 transitions. Word has length 136 [2025-03-17 05:22:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:07,421 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 655 transitions. [2025-03-17 05:22:07,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 655 transitions. [2025-03-17 05:22:07,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-17 05:22:07,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:07,423 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:07,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:22:07,423 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:07,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash -993737559, now seen corresponding path program 1 times [2025-03-17 05:22:07,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:07,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119498387] [2025-03-17 05:22:07,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:07,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:07,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 05:22:07,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 05:22:07,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:07,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:07,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119498387] [2025-03-17 05:22:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119498387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:07,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:07,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519415215] [2025-03-17 05:22:07,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:07,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:07,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:07,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:07,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:07,814 INFO L87 Difference]: Start difference. First operand 456 states and 655 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:07,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:07,976 INFO L93 Difference]: Finished difference Result 1252 states and 1802 transitions. [2025-03-17 05:22:07,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:07,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-17 05:22:07,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:07,982 INFO L225 Difference]: With dead ends: 1252 [2025-03-17 05:22:07,982 INFO L226 Difference]: Without dead ends: 797 [2025-03-17 05:22:07,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:07,985 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 165 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:07,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 913 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:07,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-17 05:22:08,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 710. [2025-03-17 05:22:08,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 659 states have (on average 1.4142640364188164) internal successors, (932), 660 states have internal predecessors, (932), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:22:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1020 transitions. [2025-03-17 05:22:08,017 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1020 transitions. Word has length 136 [2025-03-17 05:22:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:08,018 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1020 transitions. [2025-03-17 05:22:08,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:08,018 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1020 transitions. [2025-03-17 05:22:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:22:08,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:08,021 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:08,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:22:08,021 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:08,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:08,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1342573461, now seen corresponding path program 1 times [2025-03-17 05:22:08,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:08,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338810425] [2025-03-17 05:22:08,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:08,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:08,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:22:08,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:22:08,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:08,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:22:08,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338810425] [2025-03-17 05:22:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338810425] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:08,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541482863] [2025-03-17 05:22:08,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:08,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:22:08,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:08,593 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:22:08,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:22:08,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:22:08,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:22:08,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:08,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:08,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:22:08,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:08,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 05:22:08,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-17 05:22:09,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2025-03-17 05:22:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-17 05:22:09,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:09,998 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:22:09,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541482863] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:22:09,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:22:09,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2025-03-17 05:22:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705405510] [2025-03-17 05:22:09,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:22:09,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 05:22:10,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:10,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 05:22:10,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:22:10,001 INFO L87 Difference]: Start difference. First operand 710 states and 1020 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 24 states have internal predecessors, (160), 9 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 6 states have call predecessors, (48), 9 states have call successors, (48) [2025-03-17 05:22:11,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:11,388 INFO L93 Difference]: Finished difference Result 2030 states and 2889 transitions. [2025-03-17 05:22:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 05:22:11,389 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 24 states have internal predecessors, (160), 9 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 6 states have call predecessors, (48), 9 states have call successors, (48) Word has length 138 [2025-03-17 05:22:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:11,399 INFO L225 Difference]: With dead ends: 2030 [2025-03-17 05:22:11,399 INFO L226 Difference]: Without dead ends: 1321 [2025-03-17 05:22:11,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=1719, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 05:22:11,403 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 2450 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2451 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:11,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2451 Valid, 1248 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:22:11,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-03-17 05:22:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1035. [2025-03-17 05:22:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 947 states have (on average 1.4002111932418162) internal successors, (1326), 949 states have internal predecessors, (1326), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-17 05:22:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1470 transitions. [2025-03-17 05:22:11,461 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1470 transitions. Word has length 138 [2025-03-17 05:22:11,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:11,462 INFO L471 AbstractCegarLoop]: Abstraction has 1035 states and 1470 transitions. [2025-03-17 05:22:11,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 24 states have internal predecessors, (160), 9 states have call successors, (48), 3 states have call predecessors, (48), 6 states have return successors, (48), 6 states have call predecessors, (48), 9 states have call successors, (48) [2025-03-17 05:22:11,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1470 transitions. [2025-03-17 05:22:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-17 05:22:11,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:11,464 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:11,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 05:22:11,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 05:22:11,665 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:11,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1177065199, now seen corresponding path program 1 times [2025-03-17 05:22:11,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:11,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100280434] [2025-03-17 05:22:11,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:11,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:11,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 05:22:11,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 05:22:11,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:11,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:12,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:12,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100280434] [2025-03-17 05:22:12,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100280434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:12,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:12,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:22:12,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273109750] [2025-03-17 05:22:12,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:12,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:22:12,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:12,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:22:12,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:12,112 INFO L87 Difference]: Start difference. First operand 1035 states and 1470 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:12,279 INFO L93 Difference]: Finished difference Result 2193 states and 3114 transitions. [2025-03-17 05:22:12,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:12,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-17 05:22:12,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:12,284 INFO L225 Difference]: With dead ends: 2193 [2025-03-17 05:22:12,284 INFO L226 Difference]: Without dead ends: 1159 [2025-03-17 05:22:12,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:22:12,287 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 189 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:12,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 1193 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:12,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2025-03-17 05:22:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1111. [2025-03-17 05:22:12,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 1013 states have (on average 1.399802566633761) internal successors, (1418), 1016 states have internal predecessors, (1418), 80 states have call successors, (80), 17 states have call predecessors, (80), 17 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:22:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1578 transitions. [2025-03-17 05:22:12,343 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1578 transitions. Word has length 138 [2025-03-17 05:22:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:12,343 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1578 transitions. [2025-03-17 05:22:12,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1578 transitions. [2025-03-17 05:22:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:22:12,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:12,344 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:12,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:22:12,344 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:12,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:12,346 INFO L85 PathProgramCache]: Analyzing trace with hash 488434620, now seen corresponding path program 1 times [2025-03-17 05:22:12,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:12,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428786739] [2025-03-17 05:22:12,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:12,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:12,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:22:12,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:22:12,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:12,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:12,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:22:12,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428786739] [2025-03-17 05:22:12,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428786739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:12,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:12,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:12,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814471088] [2025-03-17 05:22:12,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:12,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:12,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:22:12,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:12,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:12,613 INFO L87 Difference]: Start difference. First operand 1111 states and 1578 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:12,749 INFO L93 Difference]: Finished difference Result 2225 states and 3150 transitions. [2025-03-17 05:22:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:12,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2025-03-17 05:22:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:12,754 INFO L225 Difference]: With dead ends: 2225 [2025-03-17 05:22:12,754 INFO L226 Difference]: Without dead ends: 1115 [2025-03-17 05:22:12,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:12,757 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 150 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:12,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 697 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-17 05:22:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 948. [2025-03-17 05:22:12,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 873 states have (on average 1.392898052691867) internal successors, (1216), 874 states have internal predecessors, (1216), 60 states have call successors, (60), 14 states have call predecessors, (60), 14 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:22:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1336 transitions. [2025-03-17 05:22:12,818 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1336 transitions. Word has length 139 [2025-03-17 05:22:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:12,818 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1336 transitions. [2025-03-17 05:22:12,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1336 transitions. [2025-03-17 05:22:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:22:12,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:12,820 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:12,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:22:12,820 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:12,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1936378457, now seen corresponding path program 1 times [2025-03-17 05:22:12,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:22:12,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407742011] [2025-03-17 05:22:12,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:12,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:22:12,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:22:12,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:22:12,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:12,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:22:12,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:22:12,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:22:12,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:22:12,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:12,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:22:12,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:22:12,932 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:22:12,933 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:22:12,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:22:12,940 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:22:13,011 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:22:13,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:22:13 BoogieIcfgContainer [2025-03-17 05:22:13,014 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:22:13,014 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:22:13,014 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:22:13,014 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:22:13,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:55" (3/4) ... [2025-03-17 05:22:13,016 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:22:13,018 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:22:13,018 INFO L158 Benchmark]: Toolchain (without parser) took 19090.34ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 112.1MB in the beginning and 442.9MB in the end (delta: -330.8MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2025-03-17 05:22:13,018 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:22:13,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.44ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 96.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:22:13,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.23ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 92.7MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:22:13,019 INFO L158 Benchmark]: Boogie Preprocessor took 67.57ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 88.1MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:22:13,020 INFO L158 Benchmark]: IcfgBuilder took 786.70ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 50.3MB in the end (delta: 37.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:22:13,020 INFO L158 Benchmark]: TraceAbstraction took 17884.31ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 49.8MB in the beginning and 443.0MB in the end (delta: -393.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:22:13,020 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 528.5MB. Free memory was 443.0MB in the beginning and 442.9MB in the end (delta: 108.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:22:13,021 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.16ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.44ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 96.5MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.23ms. Allocated memory is still 142.6MB. Free memory was 96.5MB in the beginning and 92.7MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.57ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 88.1MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 786.70ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 50.3MB in the end (delta: 37.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17884.31ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 49.8MB in the beginning and 443.0MB in the end (delta: -393.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 528.5MB. Free memory was 443.0MB in the beginning and 442.9MB in the end (delta: 108.2kB). There was no memory consumed. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 26, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {1, 0}, {0, 0} }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L25-L27] double double_Array_0[5] = { 127.5, 15.75, 8.5, -0.5, 5.25 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L28-L30] signed long int signed_long_int_Array_0[5] = { -5, -100, 500, -5, -64 }; [L31] unsigned char last_1_BOOL_unsigned_char_Array_0_0__0_ = 1; [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L90] EXPR BOOL_unsigned_char_Array_0[0][0] [L90] last_1_BOOL_unsigned_char_Array_0_0__0_ = BOOL_unsigned_char_Array_0[0][0] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L68] double_Array_0[1] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[1] [L69] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F [L69] EXPR double_Array_0[1] [L69] EXPR double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] EXPR (double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] CALL assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L69] RET assume_abort_if_not((double_Array_0[1] >= -461168.6018427382800e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 4611686.018427382800e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L70] double_Array_0[2] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[2] [L71] EXPR double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] EXPR double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F [L71] EXPR double_Array_0[2] [L71] EXPR double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] EXPR (double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] EXPR (double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] CALL assume_abort_if_not((double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L71] RET assume_abort_if_not((double_Array_0[2] >= -922337.2036854765600e+13F && double_Array_0[2] <= -1.0e-20F) || (double_Array_0[2] <= 9223372.036854765600e+12F && double_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L72] double_Array_0[3] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] EXPR (double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] CALL assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L73] RET assume_abort_if_not((double_Array_0[3] >= -461168.6018427382800e+13F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 4611686.018427382800e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L74] double_Array_0[4] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] EXPR (double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] CALL assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L75] RET assume_abort_if_not((double_Array_0[4] >= -461168.6018427382800e+13F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 4611686.018427382800e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L76] signed_long_int_Array_0[0] = __VERIFIER_nondet_long() [L77] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L77] CALL assume_abort_if_not(signed_long_int_Array_0[0] >= -536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L77] RET assume_abort_if_not(signed_long_int_Array_0[0] >= -536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L78] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(signed_long_int_Array_0[0] <= 536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L78] RET assume_abort_if_not(signed_long_int_Array_0[0] <= 536870912) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L79] signed_long_int_Array_0[1] = __VERIFIER_nondet_long() [L80] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L80] CALL assume_abort_if_not(signed_long_int_Array_0[1] >= -536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L80] RET assume_abort_if_not(signed_long_int_Array_0[1] >= -536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L81] EXPR signed_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(signed_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L81] RET assume_abort_if_not(signed_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L82] signed_long_int_Array_0[2] = __VERIFIER_nondet_long() [L83] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L83] CALL assume_abort_if_not(signed_long_int_Array_0[2] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L83] RET assume_abort_if_not(signed_long_int_Array_0[2] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L84] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L84] CALL assume_abort_if_not(signed_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L84] RET assume_abort_if_not(signed_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L85] signed_long_int_Array_0[3] = __VERIFIER_nondet_long() [L86] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L86] CALL assume_abort_if_not(signed_long_int_Array_0[3] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L86] RET assume_abort_if_not(signed_long_int_Array_0[3] >= -1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L87] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L87] CALL assume_abort_if_not(signed_long_int_Array_0[3] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L87] RET assume_abort_if_not(signed_long_int_Array_0[3] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L101] RET updateVariables() [L102] CALL step() [L35] unsigned char stepLocal_0 = last_1_BOOL_unsigned_char_Array_0_0__0_; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}, stepLocal_0=1] [L36] COND FALSE !(! last_1_BOOL_unsigned_char_Array_0_0__0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L41] EXPR signed_long_int_Array_0[3] [L41] signed long int stepLocal_2 = signed_long_int_Array_0[3]; [L42] EXPR signed_long_int_Array_0[1] [L42] signed long int stepLocal_1 = signed_long_int_Array_0[1]; [L43] EXPR signed_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L43] COND FALSE !(signed_long_int_Array_0[2] <= stepLocal_2) [L50] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L50] COND FALSE !(! BOOL_unsigned_char_Array_0[0][0]) [L53] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L53] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L53] EXPR signed_long_int_Array_0[0] [L53] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}, stepLocal_0=1, stepLocal_1=-536870911] [L53] EXPR signed_long_int_Array_0[1] [L53] EXPR signed_long_int_Array_0[3] [L53] signed_long_int_Array_0[4] = ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]) [L55] BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L55] COND FALSE !(BOOL_unsigned_char_Array_0[0][1]) [L58] EXPR double_Array_0[4] [L58] double_Array_0[0] = double_Array_0[4] [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR (! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 [L93] EXPR (! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3])))) [L93] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))) [L93] EXPR signed_long_int_Array_0[4] [L93] EXPR signed_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) [L93] EXPR signed_long_int_Array_0[0] [L93] EXPR ((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR signed_long_int_Array_0[1] [L93] EXPR signed_long_int_Array_0[3] [L93] EXPR (! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1) [L93] EXPR signed_long_int_Array_0[2] [L93] EXPR signed_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1 [L93] EXPR (signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR (((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) [L93] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4])) [L93] EXPR double_Array_0[0] [L93] EXPR double_Array_0[4] [L93] EXPR BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93] EXPR ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L93-L94] return ((((! last_1_BOOL_unsigned_char_Array_0_0__0_) ? ((last_1_BOOL_unsigned_char_Array_0_0__0_ && last_1_BOOL_unsigned_char_Array_0_0__0_) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] || BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) && ((! BOOL_unsigned_char_Array_0[0][0]) ? (signed_long_int_Array_0[4] == ((signed long int) (signed_long_int_Array_0[3] + signed_long_int_Array_0[2]))) : (signed_long_int_Array_0[4] == ((signed long int) ((((((signed_long_int_Array_0[0]) < 0 ) ? -(signed_long_int_Array_0[0]) : (signed_long_int_Array_0[0]))) + signed_long_int_Array_0[1]) + signed_long_int_Array_0[3]))))) && ((signed_long_int_Array_0[2] <= signed_long_int_Array_0[3]) ? ((signed_long_int_Array_0[1] >= signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][1] || (! BOOL_unsigned_char_Array_0[1][0]))))) : 1)) && (BOOL_unsigned_char_Array_0[0][1] ? (double_Array_0[0] == ((double) (((((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) < ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))))))) ? ((((((double_Array_0[1]) > (double_Array_0[3])) ? (double_Array_0[1]) : (double_Array_0[3]))) + double_Array_0[4])) : ((((((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) < 0 ) ? -((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2]))) : ((((3.5) < (double_Array_0[2])) ? (3.5) : (double_Array_0[2])))))))))) : (double_Array_0[0] == ((double) double_Array_0[4]))) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_0__0_=1, signed_long_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 143 locations, 231 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5394 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5388 mSDsluCounter, 22802 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17636 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3778 IncrementalHoareTripleChecker+Invalid, 4032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 5166 mSDtfsCounter, 3778 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1032 GetRequests, 870 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1111occurred in iteration=19, InterpolantAutomatonStates: 146, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 20 MinimizatonAttempts, 1421 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 3485 NumberOfCodeBlocks, 3485 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 3458 ConstructedInterpolants, 0 QuantifiedInterpolants, 9420 SizeOfPredicates, 5 NumberOfNonLiveVariables, 2194 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 26 InterpolantComputations, 19 PerfectInterpolantSequences, 12189/12480 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:22:13,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5c5409edee222b3f26bc580399bcb562d4fe1c01c7706a6bada265380f08e33c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:22:15,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:22:15,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:22:15,415 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:22:15,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:22:15,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:22:15,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:22:15,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:22:15,437 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:22:15,437 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:22:15,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:22:15,438 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:22:15,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:22:15,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:22:15,438 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:22:15,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:22:15,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:22:15,439 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:22:15,440 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:22:15,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:22:15,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:22:15,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:22:15,441 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:22:15,441 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:22:15,441 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:22:15,441 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:22:15,441 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:22:15,441 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:22:15,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:22:15,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:22:15,441 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/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 -> 5c5409edee222b3f26bc580399bcb562d4fe1c01c7706a6bada265380f08e33c [2025-03-17 05:22:15,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:22:15,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:22:15,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:22:15,734 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:22:15,735 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:22:15,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2025-03-17 05:22:16,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79aa879d/caca4aeb061544ec832bf4e59cf8aafa/FLAGd59f62f64 [2025-03-17 05:22:17,241 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:22:17,242 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2025-03-17 05:22:17,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79aa879d/caca4aeb061544ec832bf4e59cf8aafa/FLAGd59f62f64 [2025-03-17 05:22:17,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a79aa879d/caca4aeb061544ec832bf4e59cf8aafa [2025-03-17 05:22:17,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:22:17,277 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:22:17,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:22:17,278 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:22:17,282 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:22:17,283 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d7ac95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17, skipping insertion in model container [2025-03-17 05:22:17,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:22:17,408 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2025-03-17 05:22:17,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:22:17,475 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:22:17,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2025-03-17 05:22:17,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:22:17,551 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:22:17,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17 WrapperNode [2025-03-17 05:22:17,552 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:22:17,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:22:17,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:22:17,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:22:17,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,615 INFO L138 Inliner]: procedures = 33, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 622 [2025-03-17 05:22:17,616 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:22:17,617 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:22:17,617 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:22:17,617 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:22:17,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,656 INFO L175 MemorySlicer]: Split 151 memory accesses to 4 slices as follows [2, 31, 75, 43]. 50 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 17 writes are split as follows [0, 5, 6, 6]. [2025-03-17 05:22:17,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:22:17,695 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:22:17,695 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:22:17,695 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:22:17,696 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (1/1) ... [2025-03-17 05:22:17,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:22:17,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:22:17,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:22:17,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:22:17,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:22:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:22:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:22:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:22:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:22:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:22:17,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:22:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:22:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:22:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:22:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:22:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:22:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:22:17,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:22:17,770 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:22:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:22:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:22:17,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:22:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:22:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:22:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:22:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:22:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:22:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:22:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:22:17,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:22:17,918 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:22:17,919 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:22:19,728 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~ite115#1;havoc property_#t~ite114#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short112#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem126#1;havoc property_#t~mem120#1;havoc property_#t~ite123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite140#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~short141#1;havoc property_#t~mem142#1;havoc property_#t~ite179#1;havoc property_#t~mem176#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite151#1;havoc property_#t~mem150#1;havoc property_#t~ite158#1;havoc property_#t~mem152#1;havoc property_#t~ite154#1;havoc property_#t~mem153#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~ite175#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite163#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~ite167#1;havoc property_#t~mem166#1;havoc property_#t~ite174#1;havoc property_#t~mem168#1;havoc property_#t~ite170#1;havoc property_#t~mem169#1;havoc property_#t~mem171#1;havoc property_#t~ite173#1;havoc property_#t~mem172#1;havoc property_#t~mem178#1;havoc property_#t~mem177#1;havoc property_#t~short180#1; [2025-03-17 05:22:19,786 INFO L? ?]: Removed 190 outVars from TransFormulas that were not future-live. [2025-03-17 05:22:19,786 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:22:19,802 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:22:19,802 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:22:19,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:19 BoogieIcfgContainer [2025-03-17 05:22:19,803 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:22:19,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:22:19,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:22:19,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:22:19,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:22:17" (1/3) ... [2025-03-17 05:22:19,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccf7bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:22:19, skipping insertion in model container [2025-03-17 05:22:19,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:22:17" (2/3) ... [2025-03-17 05:22:19,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccf7bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:22:19, skipping insertion in model container [2025-03-17 05:22:19,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:22:19" (3/3) ... [2025-03-17 05:22:19,813 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-3.i [2025-03-17 05:22:19,826 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:22:19,828 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-3.i that has 2 procedures, 143 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:22:19,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:22:19,884 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;@52d68b8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:22:19,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:22:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 124 states have (on average 1.4758064516129032) internal successors, (183), 125 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:22:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:22:19,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:19,898 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:19,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:19,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:19,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1476816455, now seen corresponding path program 1 times [2025-03-17 05:22:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:19,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837207104] [2025-03-17 05:22:19,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:19,914 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:19,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:19,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:19,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:22:20,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:22:20,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:22:20,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:20,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:20,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:22:20,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2025-03-17 05:22:20,345 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:20,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:20,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837207104] [2025-03-17 05:22:20,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837207104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:20,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:20,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:22:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235132857] [2025-03-17 05:22:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:20,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:22:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:20,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:22:20,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:22:20,373 INFO L87 Difference]: Start difference. First operand has 143 states, 124 states have (on average 1.4758064516129032) internal successors, (183), 125 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:20,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:20,403 INFO L93 Difference]: Finished difference Result 283 states and 444 transitions. [2025-03-17 05:22:20,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:22:20,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2025-03-17 05:22:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:20,409 INFO L225 Difference]: With dead ends: 283 [2025-03-17 05:22:20,409 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 05:22:20,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:22:20,413 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:20,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 05:22:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-03-17 05:22:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.4552845528455285) internal successors, (179), 123 states have internal predecessors, (179), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:22:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 211 transitions. [2025-03-17 05:22:20,454 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 211 transitions. Word has length 129 [2025-03-17 05:22:20,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:20,458 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 211 transitions. [2025-03-17 05:22:20,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 211 transitions. [2025-03-17 05:22:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-17 05:22:20,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:20,460 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:20,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:22:20,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:20,661 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:20,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:20,661 INFO L85 PathProgramCache]: Analyzing trace with hash 433266565, now seen corresponding path program 1 times [2025-03-17 05:22:20,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:20,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503247649] [2025-03-17 05:22:20,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:20,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:20,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:20,665 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:20,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:22:20,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-17 05:22:20,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-17 05:22:20,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:20,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:20,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:22:20,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:21,015 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:21,015 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503247649] [2025-03-17 05:22:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503247649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:22:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698198976] [2025-03-17 05:22:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:21,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:22:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:21,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:22:21,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:21,017 INFO L87 Difference]: Start difference. First operand 141 states and 211 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:21,071 INFO L93 Difference]: Finished difference Result 283 states and 424 transitions. [2025-03-17 05:22:21,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:22:21,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2025-03-17 05:22:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:21,075 INFO L225 Difference]: With dead ends: 283 [2025-03-17 05:22:21,075 INFO L226 Difference]: Without dead ends: 143 [2025-03-17 05:22:21,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:21,077 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:21,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 616 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-03-17 05:22:21,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-03-17 05:22:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 125 states have (on average 1.448) internal successors, (181), 125 states have internal predecessors, (181), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 05:22:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 213 transitions. [2025-03-17 05:22:21,093 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 213 transitions. Word has length 129 [2025-03-17 05:22:21,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:21,095 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 213 transitions. [2025-03-17 05:22:21,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:21,095 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 213 transitions. [2025-03-17 05:22:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-17 05:22:21,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:21,098 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:21,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 05:22:21,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:21,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:21,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:21,300 INFO L85 PathProgramCache]: Analyzing trace with hash 111249123, now seen corresponding path program 1 times [2025-03-17 05:22:21,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:21,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425175878] [2025-03-17 05:22:21,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:21,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:21,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:21,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:22:21,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-17 05:22:21,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-17 05:22:21,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:21,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:21,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:22:21,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:21,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-03-17 05:22:21,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-17 05:22:22,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:22,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 13 [2025-03-17 05:22:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-17 05:22:22,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:22,717 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:22,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425175878] [2025-03-17 05:22:22,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425175878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:22,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:22,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:22:22,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96820806] [2025-03-17 05:22:22,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:22,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:22,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:22,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:22,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:22,720 INFO L87 Difference]: Start difference. First operand 143 states and 213 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:22,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:22,887 INFO L93 Difference]: Finished difference Result 427 states and 637 transitions. [2025-03-17 05:22:22,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:22:22,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2025-03-17 05:22:22,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:22,891 INFO L225 Difference]: With dead ends: 427 [2025-03-17 05:22:22,891 INFO L226 Difference]: Without dead ends: 285 [2025-03-17 05:22:22,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:22,896 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 283 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:22,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 776 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:22,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-17 05:22:22,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 280. [2025-03-17 05:22:22,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 245 states have (on average 1.4448979591836735) internal successors, (354), 245 states have internal predecessors, (354), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 418 transitions. [2025-03-17 05:22:22,935 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 418 transitions. Word has length 131 [2025-03-17 05:22:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:22,935 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 418 transitions. [2025-03-17 05:22:22,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:22:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 418 transitions. [2025-03-17 05:22:22,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-17 05:22:22,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:22,937 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:22,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 05:22:23,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:23,138 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:23,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1933370771, now seen corresponding path program 1 times [2025-03-17 05:22:23,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:23,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035937076] [2025-03-17 05:22:23,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:23,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:23,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:23,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:23,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:22:23,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-17 05:22:23,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-17 05:22:23,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:23,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:23,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:22:23,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:23,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 05:22:23,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2025-03-17 05:22:24,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:24,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 55 [2025-03-17 05:22:24,865 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:24,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 17 [2025-03-17 05:22:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-17 05:22:24,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:22:25,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:25,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035937076] [2025-03-17 05:22:25,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1035937076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:22:25,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:22:25,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2025-03-17 05:22:25,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764831402] [2025-03-17 05:22:25,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:22:25,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:22:25,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:25,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:22:25,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:22:25,382 INFO L87 Difference]: Start difference. First operand 280 states and 418 transitions. Second operand has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-17 05:22:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:26,987 INFO L93 Difference]: Finished difference Result 666 states and 978 transitions. [2025-03-17 05:22:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 05:22:26,989 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) Word has length 132 [2025-03-17 05:22:26,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:26,992 INFO L225 Difference]: With dead ends: 666 [2025-03-17 05:22:26,992 INFO L226 Difference]: Without dead ends: 524 [2025-03-17 05:22:26,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=256, Invalid=800, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:22:26,994 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1402 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:26,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 1891 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:22:26,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-03-17 05:22:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 288. [2025-03-17 05:22:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 251 states have (on average 1.4342629482071714) internal successors, (360), 251 states have internal predecessors, (360), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 424 transitions. [2025-03-17 05:22:27,022 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 424 transitions. Word has length 132 [2025-03-17 05:22:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:27,022 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 424 transitions. [2025-03-17 05:22:27,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-17 05:22:27,023 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 424 transitions. [2025-03-17 05:22:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:22:27,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:27,024 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:27,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:22:27,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:27,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:27,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:27,226 INFO L85 PathProgramCache]: Analyzing trace with hash 239453830, now seen corresponding path program 1 times [2025-03-17 05:22:27,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680128326] [2025-03-17 05:22:27,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:27,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:27,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:27,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:27,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:22:27,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:22:27,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:22:27,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:27,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:27,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:22:27,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:27,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:22:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:27,587 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:27,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:27,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680128326] [2025-03-17 05:22:27,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680128326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:27,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:27,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:27,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366579355] [2025-03-17 05:22:27,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:27,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:27,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:27,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:27,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:27,589 INFO L87 Difference]: Start difference. First operand 288 states and 424 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:28,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:28,145 INFO L93 Difference]: Finished difference Result 721 states and 1061 transitions. [2025-03-17 05:22:28,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:22:28,145 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-17 05:22:28,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:28,148 INFO L225 Difference]: With dead ends: 721 [2025-03-17 05:22:28,148 INFO L226 Difference]: Without dead ends: 434 [2025-03-17 05:22:28,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:22:28,151 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 195 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:28,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 713 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:22:28,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-17 05:22:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 286. [2025-03-17 05:22:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 249 states have (on average 1.429718875502008) internal successors, (356), 249 states have internal predecessors, (356), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:28,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 420 transitions. [2025-03-17 05:22:28,182 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 420 transitions. Word has length 133 [2025-03-17 05:22:28,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:28,182 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 420 transitions. [2025-03-17 05:22:28,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:28,182 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 420 transitions. [2025-03-17 05:22:28,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-17 05:22:28,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:28,184 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:28,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:22:28,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:28,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:28,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:28,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1518213532, now seen corresponding path program 1 times [2025-03-17 05:22:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:28,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300969648] [2025-03-17 05:22:28,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:28,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:28,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:28,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:28,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:22:28,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-17 05:22:28,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-17 05:22:28,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:28,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:28,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:22:28,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:28,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 05:22:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:28,774 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:28,774 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:28,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300969648] [2025-03-17 05:22:28,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300969648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:28,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:28,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:22:28,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192341526] [2025-03-17 05:22:28,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:28,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:22:28,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:28,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:22:28,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:22:28,777 INFO L87 Difference]: Start difference. First operand 286 states and 420 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:28,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:28,985 INFO L93 Difference]: Finished difference Result 846 states and 1242 transitions. [2025-03-17 05:22:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:22:28,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-17 05:22:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:28,989 INFO L225 Difference]: With dead ends: 846 [2025-03-17 05:22:28,991 INFO L226 Difference]: Without dead ends: 561 [2025-03-17 05:22:28,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:28,992 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 319 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:28,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 637 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-17 05:22:29,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 473. [2025-03-17 05:22:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 418 states have (on average 1.430622009569378) internal successors, (598), 418 states have internal predecessors, (598), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:22:29,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 694 transitions. [2025-03-17 05:22:29,022 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 694 transitions. Word has length 133 [2025-03-17 05:22:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:29,022 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 694 transitions. [2025-03-17 05:22:29,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 694 transitions. [2025-03-17 05:22:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-17 05:22:29,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:29,023 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:29,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 05:22:29,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:29,226 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:29,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:29,226 INFO L85 PathProgramCache]: Analyzing trace with hash 282623990, now seen corresponding path program 1 times [2025-03-17 05:22:29,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:29,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417727895] [2025-03-17 05:22:29,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:29,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:29,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:29,230 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:29,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 05:22:29,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-17 05:22:29,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-17 05:22:29,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:29,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:29,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:22:29,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:29,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 05:22:29,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2025-03-17 05:22:30,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2025-03-17 05:22:30,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:30,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 18 [2025-03-17 05:22:30,450 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-17 05:22:30,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:22:30,762 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417727895] [2025-03-17 05:22:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417727895] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:22:30,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:22:30,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-03-17 05:22:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318123723] [2025-03-17 05:22:30,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:22:30,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 05:22:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:30,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 05:22:30,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:22:30,764 INFO L87 Difference]: Start difference. First operand 473 states and 694 transitions. Second operand has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 17 states have internal predecessors, (106), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-17 05:22:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:31,915 INFO L93 Difference]: Finished difference Result 707 states and 1031 transitions. [2025-03-17 05:22:31,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:22:31,916 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 17 states have internal predecessors, (106), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) Word has length 134 [2025-03-17 05:22:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:31,919 INFO L225 Difference]: With dead ends: 707 [2025-03-17 05:22:31,919 INFO L226 Difference]: Without dead ends: 399 [2025-03-17 05:22:31,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2025-03-17 05:22:31,921 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 690 mSDsluCounter, 1959 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 2229 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:31,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 2229 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:22:31,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-17 05:22:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 309. [2025-03-17 05:22:31,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 272 states have (on average 1.4191176470588236) internal successors, (386), 272 states have internal predecessors, (386), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 450 transitions. [2025-03-17 05:22:31,952 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 450 transitions. Word has length 134 [2025-03-17 05:22:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:31,953 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 450 transitions. [2025-03-17 05:22:31,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.066666666666666) internal successors, (106), 17 states have internal predecessors, (106), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-17 05:22:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 450 transitions. [2025-03-17 05:22:31,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:22:31,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:31,955 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:31,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2025-03-17 05:22:32,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:32,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:32,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:32,157 INFO L85 PathProgramCache]: Analyzing trace with hash 262751043, now seen corresponding path program 1 times [2025-03-17 05:22:32,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:32,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840782237] [2025-03-17 05:22:32,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:32,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:32,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:32,159 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:32,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 05:22:32,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:22:32,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:22:32,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:32,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:32,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 05:22:32,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:32,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:22:32,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 05:22:32,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:32,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2025-03-17 05:22:33,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2025-03-17 05:22:33,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:33,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 57 [2025-03-17 05:22:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 332 proven. 21 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-17 05:22:36,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:37,427 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:37,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840782237] [2025-03-17 05:22:37,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840782237] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:37,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:37,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [30] total 35 [2025-03-17 05:22:37,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319974849] [2025-03-17 05:22:37,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:37,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:22:37,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:37,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:22:37,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 05:22:37,428 INFO L87 Difference]: Start difference. First operand 309 states and 450 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:38,204 INFO L93 Difference]: Finished difference Result 877 states and 1274 transitions. [2025-03-17 05:22:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:22:38,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2025-03-17 05:22:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:38,207 INFO L225 Difference]: With dead ends: 877 [2025-03-17 05:22:38,209 INFO L226 Difference]: Without dead ends: 569 [2025-03-17 05:22:38,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 05:22:38,211 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 163 mSDsluCounter, 1629 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1888 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:38,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1888 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:22:38,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-17 05:22:38,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 565. [2025-03-17 05:22:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 508 states have (on average 1.4251968503937007) internal successors, (724), 510 states have internal predecessors, (724), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:22:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 820 transitions. [2025-03-17 05:22:38,248 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 820 transitions. Word has length 135 [2025-03-17 05:22:38,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:38,248 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 820 transitions. [2025-03-17 05:22:38,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 820 transitions. [2025-03-17 05:22:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:22:38,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:38,250 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:38,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 05:22:38,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:38,450 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:38,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:38,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1534200316, now seen corresponding path program 1 times [2025-03-17 05:22:38,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:38,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451652786] [2025-03-17 05:22:38,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:38,451 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:38,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:38,453 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:38,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 05:22:38,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:22:38,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:22:38,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:38,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:38,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:22:38,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:38,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:22:38,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 05:22:38,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 05:22:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:38,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:38,868 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:38,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451652786] [2025-03-17 05:22:38,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451652786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:38,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:38,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807608552] [2025-03-17 05:22:38,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:38,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:38,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:38,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:38,869 INFO L87 Difference]: Start difference. First operand 565 states and 820 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:39,126 INFO L93 Difference]: Finished difference Result 1171 states and 1697 transitions. [2025-03-17 05:22:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:39,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2025-03-17 05:22:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:39,135 INFO L225 Difference]: With dead ends: 1171 [2025-03-17 05:22:39,135 INFO L226 Difference]: Without dead ends: 607 [2025-03-17 05:22:39,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:39,138 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 156 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:39,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 881 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:22:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-17 05:22:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 559. [2025-03-17 05:22:39,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 502 states have (on average 1.4243027888446216) internal successors, (715), 504 states have internal predecessors, (715), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:22:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 811 transitions. [2025-03-17 05:22:39,177 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 811 transitions. Word has length 135 [2025-03-17 05:22:39,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:39,177 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 811 transitions. [2025-03-17 05:22:39,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:39,178 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 811 transitions. [2025-03-17 05:22:39,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:22:39,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:39,180 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:39,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-17 05:22:39,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:39,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:39,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:39,385 INFO L85 PathProgramCache]: Analyzing trace with hash -146073182, now seen corresponding path program 1 times [2025-03-17 05:22:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:39,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204813048] [2025-03-17 05:22:39,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:39,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:39,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:39,389 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:39,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 05:22:39,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:22:39,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:22:39,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:39,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:39,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:22:39,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:39,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:22:39,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-03-17 05:22:39,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 05:22:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:39,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:39,757 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:39,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204813048] [2025-03-17 05:22:39,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204813048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:39,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:39,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:39,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477115932] [2025-03-17 05:22:39,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:39,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:39,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:39,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:39,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:39,758 INFO L87 Difference]: Start difference. First operand 559 states and 811 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:39,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:39,912 INFO L93 Difference]: Finished difference Result 1129 states and 1630 transitions. [2025-03-17 05:22:39,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:39,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2025-03-17 05:22:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:39,916 INFO L225 Difference]: With dead ends: 1129 [2025-03-17 05:22:39,916 INFO L226 Difference]: Without dead ends: 571 [2025-03-17 05:22:39,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:22:39,918 INFO L435 NwaCegarLoop]: 320 mSDtfsCounter, 156 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:39,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1105 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:22:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-03-17 05:22:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 411. [2025-03-17 05:22:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 372 states have (on average 1.4086021505376345) internal successors, (524), 372 states have internal predecessors, (524), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 588 transitions. [2025-03-17 05:22:39,938 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 588 transitions. Word has length 135 [2025-03-17 05:22:39,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:39,938 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 588 transitions. [2025-03-17 05:22:39,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 588 transitions. [2025-03-17 05:22:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-17 05:22:39,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:39,939 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:39,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 05:22:40,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:40,140 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:40,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:40,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1943024541, now seen corresponding path program 1 times [2025-03-17 05:22:40,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:40,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525070099] [2025-03-17 05:22:40,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:40,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:40,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:40,143 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:40,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-17 05:22:40,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-17 05:22:40,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-17 05:22:40,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:40,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:40,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 05:22:40,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:40,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:22:40,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 05:22:41,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:41,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2025-03-17 05:22:41,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2025-03-17 05:22:41,776 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:41,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 57 [2025-03-17 05:22:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-17 05:22:47,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:47,535 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:47,535 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:47,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525070099] [2025-03-17 05:22:47,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525070099] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:47,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:22:47,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [30] total 35 [2025-03-17 05:22:47,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709220916] [2025-03-17 05:22:47,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:47,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:22:47,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:47,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:22:47,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 05:22:47,536 INFO L87 Difference]: Start difference. First operand 411 states and 588 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:48,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:48,221 INFO L93 Difference]: Finished difference Result 983 states and 1408 transitions. [2025-03-17 05:22:48,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:22:48,222 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2025-03-17 05:22:48,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:48,224 INFO L225 Difference]: With dead ends: 983 [2025-03-17 05:22:48,224 INFO L226 Difference]: Without dead ends: 573 [2025-03-17 05:22:48,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 05:22:48,226 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 159 mSDsluCounter, 2207 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 2570 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:48,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 2570 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:22:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-17 05:22:48,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 405. [2025-03-17 05:22:48,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 366 states have (on average 1.4125683060109289) internal successors, (517), 366 states have internal predecessors, (517), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 581 transitions. [2025-03-17 05:22:48,256 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 581 transitions. Word has length 135 [2025-03-17 05:22:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:48,258 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 581 transitions. [2025-03-17 05:22:48,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 9 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 581 transitions. [2025-03-17 05:22:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 05:22:48,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:48,259 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:48,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-03-17 05:22:48,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:48,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:48,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash -2040504454, now seen corresponding path program 1 times [2025-03-17 05:22:48,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:48,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806748682] [2025-03-17 05:22:48,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:48,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:48,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:48,498 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:48,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-17 05:22:48,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-17 05:22:48,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 05:22:48,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:48,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:48,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:22:48,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-17 05:22:48,779 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:22:48,780 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:48,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806748682] [2025-03-17 05:22:48,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806748682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:22:48,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:22:48,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:22:48,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911240064] [2025-03-17 05:22:48,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:22:48,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:22:48,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:48,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:22:48,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:48,781 INFO L87 Difference]: Start difference. First operand 405 states and 581 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:48,816 INFO L93 Difference]: Finished difference Result 815 states and 1169 transitions. [2025-03-17 05:22:48,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:22:48,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-03-17 05:22:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:48,818 INFO L225 Difference]: With dead ends: 815 [2025-03-17 05:22:48,819 INFO L226 Difference]: Without dead ends: 411 [2025-03-17 05:22:48,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:22:48,819 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:48,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 808 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:22:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-17 05:22:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-03-17 05:22:48,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 372 states have (on average 1.4059139784946237) internal successors, (523), 372 states have internal predecessors, (523), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:22:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 587 transitions. [2025-03-17 05:22:48,838 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 587 transitions. Word has length 137 [2025-03-17 05:22:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:48,838 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 587 transitions. [2025-03-17 05:22:48,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-17 05:22:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 587 transitions. [2025-03-17 05:22:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:22:48,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:48,840 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:48,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-17 05:22:49,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:49,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:49,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:49,041 INFO L85 PathProgramCache]: Analyzing trace with hash 488434620, now seen corresponding path program 1 times [2025-03-17 05:22:49,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:49,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005175644] [2025-03-17 05:22:49,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:49,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:49,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:49,043 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:49,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-17 05:22:49,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:22:49,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:22:49,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:49,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:49,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:22:49,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:49,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-03-17 05:22:49,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:49,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2025-03-17 05:22:50,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:50,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 66 [2025-03-17 05:22:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-17 05:22:50,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-17 05:22:51,527 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005175644] [2025-03-17 05:22:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005175644] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:22:51,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:22:51,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2025-03-17 05:22:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609856607] [2025-03-17 05:22:51,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:22:51,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 05:22:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:51,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 05:22:51,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:22:51,529 INFO L87 Difference]: Start difference. First operand 411 states and 587 transitions. Second operand has 20 states, 18 states have (on average 7.055555555555555) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-17 05:22:52,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:52,761 INFO L93 Difference]: Finished difference Result 1201 states and 1712 transitions. [2025-03-17 05:22:52,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-17 05:22:52,762 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.055555555555555) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) Word has length 139 [2025-03-17 05:22:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:52,764 INFO L225 Difference]: With dead ends: 1201 [2025-03-17 05:22:52,765 INFO L226 Difference]: Without dead ends: 791 [2025-03-17 05:22:52,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=223, Invalid=833, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:22:52,766 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 440 mSDsluCounter, 2273 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:52,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 2442 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:22:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2025-03-17 05:22:52,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 729. [2025-03-17 05:22:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 671 states have (on average 1.4172876304023845) internal successors, (951), 671 states have internal predecessors, (951), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:22:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1047 transitions. [2025-03-17 05:22:52,820 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1047 transitions. Word has length 139 [2025-03-17 05:22:52,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:52,820 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1047 transitions. [2025-03-17 05:22:52,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.055555555555555) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-17 05:22:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1047 transitions. [2025-03-17 05:22:52,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:22:52,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:52,822 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:22:52,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-17 05:22:53,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:53,023 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:53,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:53,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1936378457, now seen corresponding path program 1 times [2025-03-17 05:22:53,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:53,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104205598] [2025-03-17 05:22:53,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:53,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:53,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:53,029 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:53,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-17 05:22:53,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:22:53,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:22:53,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:53,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:53,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:22:53,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:53,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:22:54,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:54,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 98 [2025-03-17 05:22:54,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:54,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 384 treesize of output 134 [2025-03-17 05:22:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-17 05:22:54,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:55,100 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:22:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104205598] [2025-03-17 05:22:55,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104205598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:55,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [379324385] [2025-03-17 05:22:55,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:55,101 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:22:55,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:22:55,103 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:22:55,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2025-03-17 05:22:55,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:22:56,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:22:56,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:22:56,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:22:56,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 05:22:56,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:22:56,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 05:22:58,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:58,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 100 [2025-03-17 05:22:59,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:22:59,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 299 treesize of output 151 [2025-03-17 05:22:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-17 05:22:59,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:22:59,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [379324385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:22:59,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:22:59,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2025-03-17 05:22:59,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316545608] [2025-03-17 05:22:59,302 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:22:59,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:22:59,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:22:59,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:22:59,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:22:59,303 INFO L87 Difference]: Start difference. First operand 729 states and 1047 transitions. Second operand has 18 states, 18 states have (on average 6.944444444444445) internal successors, (125), 17 states have internal predecessors, (125), 4 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-17 05:23:08,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:23:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:11,534 INFO L93 Difference]: Finished difference Result 1805 states and 2558 transitions. [2025-03-17 05:23:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:23:11,535 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.944444444444445) internal successors, (125), 17 states have internal predecessors, (125), 4 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 139 [2025-03-17 05:23:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:11,541 INFO L225 Difference]: With dead ends: 1805 [2025-03-17 05:23:11,542 INFO L226 Difference]: Without dead ends: 1803 [2025-03-17 05:23:11,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 314 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:23:11,543 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 686 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:11,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 1742 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2025-03-17 05:23:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2025-03-17 05:23:11,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1793. [2025-03-17 05:23:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1651 states have (on average 1.4003634161114475) internal successors, (2312), 1657 states have internal predecessors, (2312), 117 states have call successors, (117), 24 states have call predecessors, (117), 24 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-17 05:23:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2546 transitions. [2025-03-17 05:23:11,681 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2546 transitions. Word has length 139 [2025-03-17 05:23:11,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:11,681 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2546 transitions. [2025-03-17 05:23:11,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.944444444444445) internal successors, (125), 17 states have internal predecessors, (125), 4 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-17 05:23:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2546 transitions. [2025-03-17 05:23:11,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-17 05:23:11,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:11,684 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:23:11,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2025-03-17 05:23:11,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-03-17 05:23:12,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:23:12,085 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:12,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:12,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1190392584, now seen corresponding path program 1 times [2025-03-17 05:23:12,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:12,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697157111] [2025-03-17 05:23:12,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:12,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:23:12,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:12,088 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:23:12,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-03-17 05:23:12,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-17 05:23:12,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-17 05:23:12,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:12,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:12,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:23:12,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2025-03-17 05:23:12,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:23:12,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:23:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697157111] [2025-03-17 05:23:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697157111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:23:12,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:23:12,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:23:12,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612657291] [2025-03-17 05:23:12,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:23:12,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:23:12,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:23:12,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:23:12,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:12,341 INFO L87 Difference]: Start difference. First operand 1793 states and 2546 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:12,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:23:12,527 INFO L93 Difference]: Finished difference Result 3585 states and 5091 transitions. [2025-03-17 05:23:12,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:23:12,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-03-17 05:23:12,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:23:12,534 INFO L225 Difference]: With dead ends: 3585 [2025-03-17 05:23:12,535 INFO L226 Difference]: Without dead ends: 1793 [2025-03-17 05:23:12,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:23:12,540 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 0 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:23:12,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 613 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:23:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2025-03-17 05:23:12,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1793. [2025-03-17 05:23:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1651 states have (on average 1.3985463355542096) internal successors, (2309), 1657 states have internal predecessors, (2309), 117 states have call successors, (117), 24 states have call predecessors, (117), 24 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-17 05:23:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2543 transitions. [2025-03-17 05:23:12,673 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2543 transitions. Word has length 139 [2025-03-17 05:23:12,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:23:12,674 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2543 transitions. [2025-03-17 05:23:12,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-17 05:23:12,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2543 transitions. [2025-03-17 05:23:12,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-17 05:23:12,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:12,677 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 05:23:12,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-03-17 05:23:12,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:23:12,878 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:12,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash -49760133, now seen corresponding path program 1 times [2025-03-17 05:23:12,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:23:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008145590] [2025-03-17 05:23:12,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:12,879 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:23:12,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:23:12,881 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:23:12,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2025-03-17 05:23:12,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 05:23:13,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 05:23:13,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:13,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:13,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:23:13,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:23:13,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 1 [2025-03-17 05:23:14,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:23:14,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 96