./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.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-2.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 6c2afc665f9ec9bbf6f489827c9a63486fda067f850cc8b511cbd83d8b773bd8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:20:34,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:20:35,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:20:35,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:20:35,037 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:20:35,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:20:35,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:20:35,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:20:35,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:20:35,059 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:20:35,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:20:35,059 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:20:35,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:20:35,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:20:35,060 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:20:35,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:20:35,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:20:35,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:20:35,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:20:35,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:20:35,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:20:35,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:20:35,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:20:35,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:20:35,061 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:20:35,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:20:35,061 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:20:35,061 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:20:35,062 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:20:35,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:20:35,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:20:35,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:20:35,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:20:35,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:20:35,062 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:20:35,062 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:20:35,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:20:35,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:20:35,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:20:35,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:20:35,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:20:35,063 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:20:35,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:20:35,063 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 -> 6c2afc665f9ec9bbf6f489827c9a63486fda067f850cc8b511cbd83d8b773bd8 [2025-03-17 05:20:35,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:20:35,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:20:35,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:20:35,339 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:20:35,339 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:20:35,340 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-2.i [2025-03-17 05:20:36,554 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6b27723/507ee4d448414ca68c9c7bf7816b3130/FLAG1f05bd9c2 [2025-03-17 05:20:36,821 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:20:36,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i [2025-03-17 05:20:36,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6b27723/507ee4d448414ca68c9c7bf7816b3130/FLAG1f05bd9c2 [2025-03-17 05:20:36,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd6b27723/507ee4d448414ca68c9c7bf7816b3130 [2025-03-17 05:20:36,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:20:36,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:20:36,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:20:36,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:20:36,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:20:36,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:20:36" (1/1) ... [2025-03-17 05:20:36,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a36d8f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:36, skipping insertion in model container [2025-03-17 05:20:36,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:20:36" (1/1) ... [2025-03-17 05:20:36,894 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:20:37,035 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-2.i[915,928] [2025-03-17 05:20:37,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:20:37,127 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:20:37,137 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-2.i[915,928] [2025-03-17 05:20:37,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:20:37,209 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:20:37,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37 WrapperNode [2025-03-17 05:20:37,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:20:37,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:20:37,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:20:37,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:20:37,218 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:20:37" (1/1) ... [2025-03-17 05:20:37,232 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:20:37" (1/1) ... [2025-03-17 05:20:37,271 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 511 [2025-03-17 05:20:37,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:20:37,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:20:37,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:20:37,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:20:37,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37" (1/1) ... [2025-03-17 05:20:37,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:20:37" (1/1) ... [2025-03-17 05:20:37,284 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37" (1/1) ... [2025-03-17 05:20:37,311 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2025-03-17 05:20:37,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37" (1/1) ... [2025-03-17 05:20:37,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37" (1/1) ... [2025-03-17 05:20:37,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37" (1/1) ... [2025-03-17 05:20:37,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37" (1/1) ... [2025-03-17 05:20:37,345 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37" (1/1) ... [2025-03-17 05:20:37,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37" (1/1) ... [2025-03-17 05:20:37,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:20:37,354 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:20:37,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:20:37,358 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:20:37,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37" (1/1) ... [2025-03-17 05:20:37,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:20:37,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:37,387 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:20:37,390 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:20:37,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:20:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:20:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:20:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:20:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:20:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:20:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:20:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:20:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:20:37,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:20:37,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:20:37,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:20:37,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:20:37,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:20:37,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:20:37,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:20:37,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:20:37,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:20:37,521 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:20:37,522 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:20:37,964 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem90#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite99#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~bitwise110#1;havoc property_#t~ite123#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite143#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~short144#1; [2025-03-17 05:20:38,002 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-03-17 05:20:38,002 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:20:38,020 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:20:38,020 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:20:38,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:38 BoogieIcfgContainer [2025-03-17 05:20:38,021 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:20:38,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:20:38,024 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:20:38,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:20:38,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:20:36" (1/3) ... [2025-03-17 05:20:38,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7078666a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:20:38, skipping insertion in model container [2025-03-17 05:20:38,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:37" (2/3) ... [2025-03-17 05:20:38,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7078666a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:20:38, skipping insertion in model container [2025-03-17 05:20:38,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:38" (3/3) ... [2025-03-17 05:20:38,030 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-2.i [2025-03-17 05:20:38,042 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:20:38,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-2.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:20:38,093 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:20:38,105 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;@15b49590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:20:38,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:20:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 84 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:20:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:20:38,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:38,120 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:38,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:38,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1559357607, now seen corresponding path program 1 times [2025-03-17 05:20:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:38,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590263383] [2025-03-17 05:20:38,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:38,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:20:38,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:20:38,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:38,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 05:20:38,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:38,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590263383] [2025-03-17 05:20:38,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590263383] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:38,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670328519] [2025-03-17 05:20:38,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:38,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:38,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:38,361 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:20:38,362 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:20:38,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:20:38,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:20:38,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:38,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:38,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:20:38,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:38,562 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 05:20:38,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:38,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670328519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:38,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:20:38,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:20:38,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934339837] [2025-03-17 05:20:38,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:38,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:20:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:38,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:20:38,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:20:38,585 INFO L87 Difference]: Start difference. First operand has 98 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 84 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:38,609 INFO L93 Difference]: Finished difference Result 193 states and 304 transitions. [2025-03-17 05:20:38,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:20:38,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2025-03-17 05:20:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:38,616 INFO L225 Difference]: With dead ends: 193 [2025-03-17 05:20:38,616 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 05:20:38,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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:20:38,621 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:38,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 05:20:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 05:20:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:20:38,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2025-03-17 05:20:38,653 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 96 [2025-03-17 05:20:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:38,653 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2025-03-17 05:20:38,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2025-03-17 05:20:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:20:38,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:38,657 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,665 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:20:38,860 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:20:38,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:38,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1543441789, now seen corresponding path program 1 times [2025-03-17 05:20:38,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:38,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809896314] [2025-03-17 05:20:38,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:38,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:38,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:20:38,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:20:38,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:38,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 05:20:39,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:39,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809896314] [2025-03-17 05:20:39,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809896314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:39,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910778853] [2025-03-17 05:20:39,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:39,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:39,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:39,281 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:20:39,282 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:20:39,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:20:39,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:20:39,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:39,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:39,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:20:39,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:39,482 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:39,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:39,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910778853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:39,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:20:39,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:20:39,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017086804] [2025-03-17 05:20:39,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:39,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:39,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:39,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:39,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:20:39,485 INFO L87 Difference]: Start difference. First operand 96 states and 143 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:20:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:39,528 INFO L93 Difference]: Finished difference Result 193 states and 288 transitions. [2025-03-17 05:20:39,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:39,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 96 [2025-03-17 05:20:39,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:39,530 INFO L225 Difference]: With dead ends: 193 [2025-03-17 05:20:39,530 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 05:20:39,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 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:20:39,532 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:39,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:39,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 05:20:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 05:20:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:20:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2025-03-17 05:20:39,540 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 96 [2025-03-17 05:20:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:39,542 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2025-03-17 05:20:39,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:20:39,542 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2025-03-17 05:20:39,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:20:39,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:39,545 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:20:39,745 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:20:39,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:39,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:39,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1640348782, now seen corresponding path program 1 times [2025-03-17 05:20:39,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:39,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329066519] [2025-03-17 05:20:39,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:39,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:39,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:20:39,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:20:39,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:39,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:39,888 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:39,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:39,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329066519] [2025-03-17 05:20:39,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329066519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:39,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:39,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:20:39,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52210160] [2025-03-17 05:20:39,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:39,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:20:39,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:39,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:20:39,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:20:39,893 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:20:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:39,934 INFO L93 Difference]: Finished difference Result 239 states and 355 transitions. [2025-03-17 05:20:39,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:20:39,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2025-03-17 05:20:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:39,936 INFO L225 Difference]: With dead ends: 239 [2025-03-17 05:20:39,937 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 05:20:39,939 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:20:39,940 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 60 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:39,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 05:20:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2025-03-17 05:20:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 101 states have internal predecessors, (148), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:20:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2025-03-17 05:20:39,956 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 99 [2025-03-17 05:20:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:39,956 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2025-03-17 05:20:39,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:20:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2025-03-17 05:20:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:20:39,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:39,958 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:39,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:20:39,958 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:39,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:39,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1114755669, now seen corresponding path program 1 times [2025-03-17 05:20:39,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:39,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528188293] [2025-03-17 05:20:39,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:39,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:39,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:20:40,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:20:40,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:40,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:40,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:40,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528188293] [2025-03-17 05:20:40,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528188293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:40,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:40,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:20:40,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388599807] [2025-03-17 05:20:40,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:40,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:20:40,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:40,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:20:40,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:20:40,973 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:41,337 INFO L93 Difference]: Finished difference Result 312 states and 462 transitions. [2025-03-17 05:20:41,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:20:41,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-03-17 05:20:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:41,339 INFO L225 Difference]: With dead ends: 312 [2025-03-17 05:20:41,339 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 05:20:41,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:20:41,340 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 96 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:41,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1219 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:20:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 05:20:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2025-03-17 05:20:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.441860465116279) internal successors, (248), 173 states have internal predecessors, (248), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:20:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 288 transitions. [2025-03-17 05:20:41,360 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 288 transitions. Word has length 99 [2025-03-17 05:20:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:41,361 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 288 transitions. [2025-03-17 05:20:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 states have internal predecessors, (42), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 288 transitions. [2025-03-17 05:20:41,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:20:41,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:41,363 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:41,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:20:41,365 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:41,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:41,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1207346060, now seen corresponding path program 1 times [2025-03-17 05:20:41,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:41,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625424682] [2025-03-17 05:20:41,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:41,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:41,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:20:41,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:20:41,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:41,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:20:41,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879190998] [2025-03-17 05:20:41,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:41,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:41,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:41,490 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:20:41,492 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:20:41,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:20:41,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:20:41,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:41,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:41,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:20:41,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:41,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:41,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:41,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625424682] [2025-03-17 05:20:41,788 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:20:41,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879190998] [2025-03-17 05:20:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879190998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:41,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:41,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:20:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747029955] [2025-03-17 05:20:41,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:41,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:20:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:41,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:20:41,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:20:41,790 INFO L87 Difference]: Start difference. First operand 195 states and 288 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:20:41,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:41,972 INFO L93 Difference]: Finished difference Result 527 states and 780 transitions. [2025-03-17 05:20:41,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:20:41,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2025-03-17 05:20:41,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:41,976 INFO L225 Difference]: With dead ends: 527 [2025-03-17 05:20:41,976 INFO L226 Difference]: Without dead ends: 333 [2025-03-17 05:20:41,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 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:20:41,977 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 130 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:41,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 352 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:20:41,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-17 05:20:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 264. [2025-03-17 05:20:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 228 states have (on average 1.4298245614035088) internal successors, (326), 229 states have internal predecessors, (326), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:20:42,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 390 transitions. [2025-03-17 05:20:42,007 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 390 transitions. Word has length 101 [2025-03-17 05:20:42,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:42,008 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 390 transitions. [2025-03-17 05:20:42,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:20:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 390 transitions. [2025-03-17 05:20:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:20:42,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:42,010 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,017 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:20:42,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:42,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:42,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2059917620, now seen corresponding path program 1 times [2025-03-17 05:20:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:42,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729023760] [2025-03-17 05:20:42,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:42,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:42,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:20:42,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:20:42,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:42,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:42,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:42,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729023760] [2025-03-17 05:20:42,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729023760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:42,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:42,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:20:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299254963] [2025-03-17 05:20:42,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:42,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:20:42,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:42,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:20:42,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:20:42,460 INFO L87 Difference]: Start difference. First operand 264 states and 390 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:20:42,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:42,690 INFO L93 Difference]: Finished difference Result 595 states and 869 transitions. [2025-03-17 05:20:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:20:42,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2025-03-17 05:20:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:42,694 INFO L225 Difference]: With dead ends: 595 [2025-03-17 05:20:42,694 INFO L226 Difference]: Without dead ends: 401 [2025-03-17 05:20:42,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:42,695 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 85 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:42,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 514 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:20:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-17 05:20:42,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 397. [2025-03-17 05:20:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 347 states have (on average 1.4092219020172911) internal successors, (489), 350 states have internal predecessors, (489), 44 states have call successors, (44), 5 states have call predecessors, (44), 5 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-17 05:20:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 577 transitions. [2025-03-17 05:20:42,718 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 577 transitions. Word has length 102 [2025-03-17 05:20:42,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:42,718 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 577 transitions. [2025-03-17 05:20:42,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:20:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 577 transitions. [2025-03-17 05:20:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:20:42,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:42,719 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:20:42,720 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:42,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:42,720 INFO L85 PathProgramCache]: Analyzing trace with hash 438098317, now seen corresponding path program 1 times [2025-03-17 05:20:42,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:42,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089502507] [2025-03-17 05:20:42,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:42,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:42,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:20:42,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:20:42,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:42,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:43,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:43,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089502507] [2025-03-17 05:20:43,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089502507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:43,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:43,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:20:43,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572303553] [2025-03-17 05:20:43,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:43,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:20:43,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:43,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:20:43,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:20:43,901 INFO L87 Difference]: Start difference. First operand 397 states and 577 transitions. Second operand has 10 states, 7 states have (on average 6.428571428571429) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:20:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:44,471 INFO L93 Difference]: Finished difference Result 897 states and 1302 transitions. [2025-03-17 05:20:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:20:44,472 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 6.428571428571429) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 102 [2025-03-17 05:20:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:44,474 INFO L225 Difference]: With dead ends: 897 [2025-03-17 05:20:44,474 INFO L226 Difference]: Without dead ends: 570 [2025-03-17 05:20:44,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:44,475 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 100 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:44,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 1040 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:20:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-17 05:20:44,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 566. [2025-03-17 05:20:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 505 states have (on average 1.4198019801980197) internal successors, (717), 510 states have internal predecessors, (717), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-17 05:20:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 821 transitions. [2025-03-17 05:20:44,520 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 821 transitions. Word has length 102 [2025-03-17 05:20:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:44,520 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 821 transitions. [2025-03-17 05:20:44,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 6.428571428571429) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:20:44,520 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 821 transitions. [2025-03-17 05:20:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:20:44,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:44,522 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:44,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:20:44,523 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:44,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:44,527 INFO L85 PathProgramCache]: Analyzing trace with hash 649449230, now seen corresponding path program 1 times [2025-03-17 05:20:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892223511] [2025-03-17 05:20:44,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:44,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:44,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:20:44,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:20:44,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:44,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:45,433 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:45,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:45,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892223511] [2025-03-17 05:20:45,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892223511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:45,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:20:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167463456] [2025-03-17 05:20:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:45,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:20:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:45,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:20:45,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:20:45,434 INFO L87 Difference]: Start difference. First operand 566 states and 821 transitions. Second operand has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:46,198 INFO L93 Difference]: Finished difference Result 1361 states and 1974 transitions. [2025-03-17 05:20:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:20:46,199 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2025-03-17 05:20:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:46,202 INFO L225 Difference]: With dead ends: 1361 [2025-03-17 05:20:46,203 INFO L226 Difference]: Without dead ends: 899 [2025-03-17 05:20:46,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:20:46,204 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 117 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:46,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1835 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:20:46,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2025-03-17 05:20:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 884. [2025-03-17 05:20:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 789 states have (on average 1.4157160963244613) internal successors, (1117), 798 states have internal predecessors, (1117), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 05:20:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1281 transitions. [2025-03-17 05:20:46,265 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1281 transitions. Word has length 102 [2025-03-17 05:20:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:46,266 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1281 transitions. [2025-03-17 05:20:46,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 14 states have internal predecessors, (45), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1281 transitions. [2025-03-17 05:20:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:20:46,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:46,267 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:46,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:20:46,268 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:46,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash -417774390, now seen corresponding path program 1 times [2025-03-17 05:20:46,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:46,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207752956] [2025-03-17 05:20:46,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:46,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:46,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:20:46,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:20:46,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:46,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:47,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:47,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207752956] [2025-03-17 05:20:47,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207752956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:47,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:47,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:20:47,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581108564] [2025-03-17 05:20:47,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:47,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:20:47,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:47,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:20:47,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:47,138 INFO L87 Difference]: Start difference. First operand 884 states and 1281 transitions. Second operand has 9 states, 5 states have (on average 9.4) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 05:20:47,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:47,770 INFO L93 Difference]: Finished difference Result 1840 states and 2661 transitions. [2025-03-17 05:20:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:20:47,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 5 states have (on average 9.4) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 104 [2025-03-17 05:20:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:47,778 INFO L225 Difference]: With dead ends: 1840 [2025-03-17 05:20:47,779 INFO L226 Difference]: Without dead ends: 1085 [2025-03-17 05:20:47,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:47,782 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 106 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:47,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 907 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:20:47,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2025-03-17 05:20:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 960. [2025-03-17 05:20:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 858 states have (on average 1.4149184149184149) internal successors, (1214), 867 states have internal predecessors, (1214), 86 states have call successors, (86), 15 states have call predecessors, (86), 15 states have return successors, (86), 77 states have call predecessors, (86), 86 states have call successors, (86) [2025-03-17 05:20:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1386 transitions. [2025-03-17 05:20:47,849 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1386 transitions. Word has length 104 [2025-03-17 05:20:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:47,850 INFO L471 AbstractCegarLoop]: Abstraction has 960 states and 1386 transitions. [2025-03-17 05:20:47,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 5 states have (on average 9.4) internal successors, (47), 9 states have internal predecessors, (47), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 05:20:47,850 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1386 transitions. [2025-03-17 05:20:47,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:20:47,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:47,851 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:47,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:20:47,852 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:47,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:47,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1585725483, now seen corresponding path program 1 times [2025-03-17 05:20:47,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:47,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568231929] [2025-03-17 05:20:47,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:47,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:47,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:20:47,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:20:47,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:47,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:48,527 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:48,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:48,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568231929] [2025-03-17 05:20:48,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568231929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:48,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:48,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:20:48,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470173183] [2025-03-17 05:20:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:48,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:20:48,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:48,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:20:48,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:48,528 INFO L87 Difference]: Start difference. First operand 960 states and 1386 transitions. Second operand has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:20:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:48,925 INFO L93 Difference]: Finished difference Result 1879 states and 2708 transitions. [2025-03-17 05:20:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:20:48,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-03-17 05:20:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:48,931 INFO L225 Difference]: With dead ends: 1879 [2025-03-17 05:20:48,931 INFO L226 Difference]: Without dead ends: 1083 [2025-03-17 05:20:48,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:20:48,933 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 77 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:48,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 931 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:20:48,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-03-17 05:20:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 954. [2025-03-17 05:20:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 856 states have (on average 1.4158878504672898) internal successors, (1212), 865 states have internal predecessors, (1212), 82 states have call successors, (82), 15 states have call predecessors, (82), 15 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 05:20:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1376 transitions. [2025-03-17 05:20:48,988 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1376 transitions. Word has length 104 [2025-03-17 05:20:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:48,988 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1376 transitions. [2025-03-17 05:20:48,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:20:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1376 transitions. [2025-03-17 05:20:48,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:20:48,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:48,991 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:48,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:20:48,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:48,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash -211225876, now seen corresponding path program 1 times [2025-03-17 05:20:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:48,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286411605] [2025-03-17 05:20:48,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:49,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:20:49,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:20:49,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:49,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:49,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:49,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286411605] [2025-03-17 05:20:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286411605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:49,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:49,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:20:49,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492113823] [2025-03-17 05:20:49,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:49,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:20:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:49,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:20:49,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:49,678 INFO L87 Difference]: Start difference. First operand 954 states and 1376 transitions. Second operand has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:20:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:50,227 INFO L93 Difference]: Finished difference Result 1857 states and 2674 transitions. [2025-03-17 05:20:50,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:20:50,228 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-03-17 05:20:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:50,236 INFO L225 Difference]: With dead ends: 1857 [2025-03-17 05:20:50,236 INFO L226 Difference]: Without dead ends: 1067 [2025-03-17 05:20:50,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:50,239 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 99 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:50,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 947 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:20:50,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2025-03-17 05:20:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 962. [2025-03-17 05:20:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 862 states have (on average 1.4106728538283062) internal successors, (1216), 871 states have internal predecessors, (1216), 82 states have call successors, (82), 17 states have call predecessors, (82), 17 states have return successors, (82), 73 states have call predecessors, (82), 82 states have call successors, (82) [2025-03-17 05:20:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1380 transitions. [2025-03-17 05:20:50,314 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1380 transitions. Word has length 104 [2025-03-17 05:20:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:50,314 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1380 transitions. [2025-03-17 05:20:50,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:20:50,315 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1380 transitions. [2025-03-17 05:20:50,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:20:50,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:50,316 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:50,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:20:50,316 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash 826990091, now seen corresponding path program 1 times [2025-03-17 05:20:50,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:50,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581857824] [2025-03-17 05:20:50,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:50,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:50,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:20:50,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:20:50,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:50,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:50,801 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:50,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:50,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581857824] [2025-03-17 05:20:50,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581857824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:50,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:50,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:20:50,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035222634] [2025-03-17 05:20:50,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:50,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:20:50,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:50,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:20:50,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:20:50,803 INFO L87 Difference]: Start difference. First operand 962 states and 1380 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:51,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:51,180 INFO L93 Difference]: Finished difference Result 2097 states and 3003 transitions. [2025-03-17 05:20:51,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:20:51,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-03-17 05:20:51,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:51,186 INFO L225 Difference]: With dead ends: 2097 [2025-03-17 05:20:51,186 INFO L226 Difference]: Without dead ends: 1269 [2025-03-17 05:20:51,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:20:51,188 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 107 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:51,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 643 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:20:51,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2025-03-17 05:20:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1061. [2025-03-17 05:20:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 951 states have (on average 1.4079915878023133) internal successors, (1339), 962 states have internal predecessors, (1339), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-17 05:20:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1519 transitions. [2025-03-17 05:20:51,239 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1519 transitions. Word has length 104 [2025-03-17 05:20:51,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:51,240 INFO L471 AbstractCegarLoop]: Abstraction has 1061 states and 1519 transitions. [2025-03-17 05:20:51,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:51,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1519 transitions. [2025-03-17 05:20:51,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:20:51,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:51,241 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:51,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:20:51,242 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:51,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1038341004, now seen corresponding path program 1 times [2025-03-17 05:20:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:51,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845418178] [2025-03-17 05:20:51,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:51,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:20:51,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:20:51,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:51,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:51,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:51,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845418178] [2025-03-17 05:20:51,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845418178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:51,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:51,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:20:51,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640574443] [2025-03-17 05:20:51,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:51,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:20:51,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:51,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:20:51,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:20:51,955 INFO L87 Difference]: Start difference. First operand 1061 states and 1519 transitions. Second operand has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:20:52,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:52,440 INFO L93 Difference]: Finished difference Result 2065 states and 2957 transitions. [2025-03-17 05:20:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:20:52,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-03-17 05:20:52,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:52,445 INFO L225 Difference]: With dead ends: 2065 [2025-03-17 05:20:52,445 INFO L226 Difference]: Without dead ends: 1168 [2025-03-17 05:20:52,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:52,448 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 99 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:52,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1283 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:20:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2025-03-17 05:20:52,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1063. [2025-03-17 05:20:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 953 states have (on average 1.4050367261280168) internal successors, (1339), 964 states have internal predecessors, (1339), 90 states have call successors, (90), 19 states have call predecessors, (90), 19 states have return successors, (90), 79 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-17 05:20:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1519 transitions. [2025-03-17 05:20:52,494 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1519 transitions. Word has length 104 [2025-03-17 05:20:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:52,494 INFO L471 AbstractCegarLoop]: Abstraction has 1063 states and 1519 transitions. [2025-03-17 05:20:52,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.714285714285714) internal successors, (47), 9 states have internal predecessors, (47), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:20:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1519 transitions. [2025-03-17 05:20:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:20:52,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:52,496 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:52,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:20:52,496 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:52,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:52,496 INFO L85 PathProgramCache]: Analyzing trace with hash 677651828, now seen corresponding path program 1 times [2025-03-17 05:20:52,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:52,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386451694] [2025-03-17 05:20:52,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:52,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:20:52,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:20:52,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:52,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:53,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:53,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386451694] [2025-03-17 05:20:53,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386451694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:53,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:53,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:20:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690714122] [2025-03-17 05:20:53,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:53,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:20:53,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:53,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:20:53,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:53,279 INFO L87 Difference]: Start difference. First operand 1063 states and 1519 transitions. Second operand has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:20:53,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:53,926 INFO L93 Difference]: Finished difference Result 2107 states and 2996 transitions. [2025-03-17 05:20:53,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:20:53,927 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2025-03-17 05:20:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:53,931 INFO L225 Difference]: With dead ends: 2107 [2025-03-17 05:20:53,931 INFO L226 Difference]: Without dead ends: 1204 [2025-03-17 05:20:53,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:20:53,933 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 256 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:53,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1166 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:20:53,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2025-03-17 05:20:53,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 1079. [2025-03-17 05:20:53,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 963 states have (on average 1.3966770508826583) internal successors, (1345), 974 states have internal predecessors, (1345), 94 states have call successors, (94), 21 states have call predecessors, (94), 21 states have return successors, (94), 83 states have call predecessors, (94), 94 states have call successors, (94) [2025-03-17 05:20:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1533 transitions. [2025-03-17 05:20:54,004 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1533 transitions. Word has length 105 [2025-03-17 05:20:54,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:54,005 INFO L471 AbstractCegarLoop]: Abstraction has 1079 states and 1533 transitions. [2025-03-17 05:20:54,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.333333333333333) internal successors, (48), 11 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:20:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1533 transitions. [2025-03-17 05:20:54,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:20:54,008 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:54,008 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:54,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:20:54,009 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:54,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash 610645075, now seen corresponding path program 1 times [2025-03-17 05:20:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:54,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425216093] [2025-03-17 05:20:54,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:54,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:20:54,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:20:54,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:54,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:55,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:55,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425216093] [2025-03-17 05:20:55,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425216093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:55,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:55,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:20:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492442094] [2025-03-17 05:20:55,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:55,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:20:55,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:55,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:20:55,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:20:55,198 INFO L87 Difference]: Start difference. First operand 1079 states and 1533 transitions. Second operand has 12 states, 9 states have (on average 5.333333333333333) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:20:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:56,778 INFO L93 Difference]: Finished difference Result 2183 states and 3093 transitions. [2025-03-17 05:20:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:20:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.333333333333333) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2025-03-17 05:20:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:56,784 INFO L225 Difference]: With dead ends: 2183 [2025-03-17 05:20:56,784 INFO L226 Difference]: Without dead ends: 1268 [2025-03-17 05:20:56,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:20:56,786 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 195 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:56,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1429 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:20:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1268 states. [2025-03-17 05:20:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1268 to 984. [2025-03-17 05:20:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 879 states have (on average 1.3970420932878271) internal successors, (1228), 888 states have internal predecessors, (1228), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 75 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:20:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1396 transitions. [2025-03-17 05:20:56,837 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1396 transitions. Word has length 105 [2025-03-17 05:20:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:56,837 INFO L471 AbstractCegarLoop]: Abstraction has 984 states and 1396 transitions. [2025-03-17 05:20:56,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.333333333333333) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:20:56,838 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1396 transitions. [2025-03-17 05:20:56,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:20:56,838 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:56,839 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:56,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:20:56,839 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:56,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:56,839 INFO L85 PathProgramCache]: Analyzing trace with hash -641157000, now seen corresponding path program 1 times [2025-03-17 05:20:56,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:56,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266419072] [2025-03-17 05:20:56,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:56,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:56,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:20:56,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:20:56,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:56,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:57,266 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:57,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:57,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266419072] [2025-03-17 05:20:57,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266419072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:57,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:20:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332311226] [2025-03-17 05:20:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:57,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:20:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:57,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:20:57,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:20:57,268 INFO L87 Difference]: Start difference. First operand 984 states and 1396 transitions. Second operand has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:57,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:57,792 INFO L93 Difference]: Finished difference Result 1935 states and 2738 transitions. [2025-03-17 05:20:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:20:57,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-03-17 05:20:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:57,797 INFO L225 Difference]: With dead ends: 1935 [2025-03-17 05:20:57,797 INFO L226 Difference]: Without dead ends: 1119 [2025-03-17 05:20:57,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:20:57,800 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 172 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:57,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1075 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:20:57,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2025-03-17 05:20:57,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 979. [2025-03-17 05:20:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 874 states have (on average 1.3958810068649885) internal successors, (1220), 883 states have internal predecessors, (1220), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 75 states have call predecessors, (84), 84 states have call successors, (84) [2025-03-17 05:20:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1388 transitions. [2025-03-17 05:20:57,860 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1388 transitions. Word has length 105 [2025-03-17 05:20:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:57,860 INFO L471 AbstractCegarLoop]: Abstraction has 979 states and 1388 transitions. [2025-03-17 05:20:57,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.857142857142857) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1388 transitions. [2025-03-17 05:20:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:20:57,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:57,862 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:57,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:20:57,862 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:57,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:57,863 INFO L85 PathProgramCache]: Analyzing trace with hash -148385814, now seen corresponding path program 1 times [2025-03-17 05:20:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:57,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314678593] [2025-03-17 05:20:57,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:57,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:57,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:20:57,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:20:57,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:57,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:20:58,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314678593] [2025-03-17 05:20:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314678593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:20:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:20:58,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182482579] [2025-03-17 05:20:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:58,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:20:58,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:58,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:20:58,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:20:58,728 INFO L87 Difference]: Start difference. First operand 979 states and 1388 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:59,530 INFO L93 Difference]: Finished difference Result 2087 states and 2957 transitions. [2025-03-17 05:20:59,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:20:59,531 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-03-17 05:20:59,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:59,537 INFO L225 Difference]: With dead ends: 2087 [2025-03-17 05:20:59,538 INFO L226 Difference]: Without dead ends: 1274 [2025-03-17 05:20:59,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:20:59,540 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 108 mSDsluCounter, 1773 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1979 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:59,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1979 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:20:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2025-03-17 05:20:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1095. [2025-03-17 05:20:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 985 states have (on average 1.3979695431472081) internal successors, (1377), 995 states have internal predecessors, (1377), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 78 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-17 05:20:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1553 transitions. [2025-03-17 05:20:59,595 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1553 transitions. Word has length 106 [2025-03-17 05:20:59,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:59,596 INFO L471 AbstractCegarLoop]: Abstraction has 1095 states and 1553 transitions. [2025-03-17 05:20:59,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:20:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1553 transitions. [2025-03-17 05:20:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:20:59,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:59,597 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:59,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:20:59,598 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:59,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash 5012630, now seen corresponding path program 1 times [2025-03-17 05:20:59,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:59,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071382950] [2025-03-17 05:20:59,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:59,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:59,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:20:59,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:20:59,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:59,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:00,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071382950] [2025-03-17 05:21:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071382950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:00,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-17 05:21:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20329807] [2025-03-17 05:21:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:00,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:21:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:00,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:21:00,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:21:00,670 INFO L87 Difference]: Start difference. First operand 1095 states and 1553 transitions. Second operand has 13 states, 9 states have (on average 5.555555555555555) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 05:21:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:01,781 INFO L93 Difference]: Finished difference Result 2109 states and 2989 transitions. [2025-03-17 05:21:01,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:21:01,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 5.555555555555555) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 107 [2025-03-17 05:21:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:01,788 INFO L225 Difference]: With dead ends: 2109 [2025-03-17 05:21:01,788 INFO L226 Difference]: Without dead ends: 1206 [2025-03-17 05:21:01,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:21:01,792 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 184 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:01,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1469 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:21:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2025-03-17 05:21:01,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1083. [2025-03-17 05:21:01,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 973 states have (on average 1.3967112024665982) internal successors, (1359), 983 states have internal predecessors, (1359), 88 states have call successors, (88), 21 states have call predecessors, (88), 21 states have return successors, (88), 78 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-17 05:21:01,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1535 transitions. [2025-03-17 05:21:01,880 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1535 transitions. Word has length 107 [2025-03-17 05:21:01,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:01,881 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1535 transitions. [2025-03-17 05:21:01,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 5.555555555555555) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 05:21:01,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1535 transitions. [2025-03-17 05:21:01,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:21:01,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:01,883 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:21:01,884 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:01,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:01,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1377068580, now seen corresponding path program 1 times [2025-03-17 05:21:01,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:01,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319035110] [2025-03-17 05:21:01,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:01,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:01,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:21:01,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:21:01,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:01,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319035110] [2025-03-17 05:21:03,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319035110] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:03,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:03,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:21:03,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249297230] [2025-03-17 05:21:03,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:21:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:03,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:21:03,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:21:03,010 INFO L87 Difference]: Start difference. First operand 1083 states and 1535 transitions. Second operand has 12 states, 8 states have (on average 6.25) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 05:21:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:03,801 INFO L93 Difference]: Finished difference Result 2043 states and 2897 transitions. [2025-03-17 05:21:03,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:21:03,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 6.25) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 107 [2025-03-17 05:21:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:03,807 INFO L225 Difference]: With dead ends: 2043 [2025-03-17 05:21:03,808 INFO L226 Difference]: Without dead ends: 1152 [2025-03-17 05:21:03,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:21:03,810 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 96 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:03,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1256 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:21:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-03-17 05:21:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 980. [2025-03-17 05:21:03,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 882 states have (on average 1.3956916099773242) internal successors, (1231), 890 states have internal predecessors, (1231), 78 states have call successors, (78), 19 states have call predecessors, (78), 19 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 05:21:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1387 transitions. [2025-03-17 05:21:03,866 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1387 transitions. Word has length 107 [2025-03-17 05:21:03,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:03,867 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1387 transitions. [2025-03-17 05:21:03,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 6.25) internal successors, (50), 12 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 05:21:03,867 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1387 transitions. [2025-03-17 05:21:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:21:03,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:03,868 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:21:03,868 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:03,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1120947357, now seen corresponding path program 1 times [2025-03-17 05:21:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72613773] [2025-03-17 05:21:03,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:03,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:21:03,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:21:03,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:03,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:04,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:04,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72613773] [2025-03-17 05:21:04,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72613773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:04,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:04,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:21:04,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373879920] [2025-03-17 05:21:04,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:04,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:21:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:04,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:21:04,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:21:04,851 INFO L87 Difference]: Start difference. First operand 980 states and 1387 transitions. Second operand has 12 states, 9 states have (on average 5.555555555555555) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:21:05,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:05,754 INFO L93 Difference]: Finished difference Result 1986 states and 2807 transitions. [2025-03-17 05:21:05,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:21:05,756 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.555555555555555) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2025-03-17 05:21:05,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:05,763 INFO L225 Difference]: With dead ends: 1986 [2025-03-17 05:21:05,763 INFO L226 Difference]: Without dead ends: 1198 [2025-03-17 05:21:05,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:21:05,767 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 324 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:05,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1209 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:21:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2025-03-17 05:21:05,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 978. [2025-03-17 05:21:05,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 880 states have (on average 1.3909090909090909) internal successors, (1224), 888 states have internal predecessors, (1224), 78 states have call successors, (78), 19 states have call predecessors, (78), 19 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 05:21:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1380 transitions. [2025-03-17 05:21:05,844 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1380 transitions. Word has length 107 [2025-03-17 05:21:05,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:05,844 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1380 transitions. [2025-03-17 05:21:05,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.555555555555555) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:21:05,844 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1380 transitions. [2025-03-17 05:21:05,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:21:05,847 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:05,847 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 05:21:05,847 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:05,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:05,849 INFO L85 PathProgramCache]: Analyzing trace with hash 36032437, now seen corresponding path program 1 times [2025-03-17 05:21:05,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:05,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566861408] [2025-03-17 05:21:05,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:05,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:05,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:21:05,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:21:05,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:05,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:06,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:21:06,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566861408] [2025-03-17 05:21:06,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566861408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:06,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:06,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:21:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023909845] [2025-03-17 05:21:06,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:06,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:21:06,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:21:06,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:21:06,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:21:06,794 INFO L87 Difference]: Start difference. First operand 978 states and 1380 transitions. Second operand has 11 states, 7 states have (on average 7.142857142857143) internal successors, (50), 11 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 05:21:07,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:07,364 INFO L93 Difference]: Finished difference Result 2021 states and 2848 transitions. [2025-03-17 05:21:07,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:21:07,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 7 states have (on average 7.142857142857143) internal successors, (50), 11 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) Word has length 107 [2025-03-17 05:21:07,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:07,370 INFO L225 Difference]: With dead ends: 2021 [2025-03-17 05:21:07,371 INFO L226 Difference]: Without dead ends: 1235 [2025-03-17 05:21:07,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:21:07,373 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 186 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:07,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1112 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:21:07,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2025-03-17 05:21:07,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 964. [2025-03-17 05:21:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 866 states have (on average 1.3833718244803694) internal successors, (1198), 874 states have internal predecessors, (1198), 78 states have call successors, (78), 19 states have call predecessors, (78), 19 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 05:21:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1354 transitions. [2025-03-17 05:21:07,448 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1354 transitions. Word has length 107 [2025-03-17 05:21:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:07,448 INFO L471 AbstractCegarLoop]: Abstraction has 964 states and 1354 transitions. [2025-03-17 05:21:07,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 7 states have (on average 7.142857142857143) internal successors, (50), 11 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-17 05:21:07,449 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1354 transitions. [2025-03-17 05:21:07,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:21:07,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:07,451 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 05:21:07,452 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:07,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:07,452 INFO L85 PathProgramCache]: Analyzing trace with hash 230634651, now seen corresponding path program 1 times [2025-03-17 05:21:07,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:21:07,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609405655] [2025-03-17 05:21:07,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:07,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:21:07,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:21:07,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:21:07,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:07,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:21:07,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [545976607] [2025-03-17 05:21:07,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:07,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:07,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:07,524 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:21:07,550 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:21:07,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:21:07,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:21:07,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:07,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:21:07,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:21:07,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:21:07,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:21:07,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:07,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:21:07,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:21:07,921 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:21:07,923 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:21:07,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:21:08,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:21:08,127 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, 1] [2025-03-17 05:21:08,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:21:08,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:21:08 BoogieIcfgContainer [2025-03-17 05:21:08,183 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:21:08,183 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:21:08,184 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:21:08,184 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:21:08,185 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:38" (3/4) ... [2025-03-17 05:21:08,187 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:21:08,187 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:21:08,188 INFO L158 Benchmark]: Toolchain (without parser) took 31334.34ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 109.8MB in the beginning and 901.1MB in the end (delta: -791.3MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2025-03-17 05:21:08,188 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:21:08,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.16ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 94.3MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:21:08,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.49ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 89.8MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:21:08,189 INFO L158 Benchmark]: Boogie Preprocessor took 80.77ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 84.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:21:08,189 INFO L158 Benchmark]: IcfgBuilder took 666.46ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 50.1MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:21:08,189 INFO L158 Benchmark]: TraceAbstraction took 30160.18ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 49.1MB in the beginning and 901.3MB in the end (delta: -852.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:21:08,189 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 981.5MB. Free memory was 901.3MB in the beginning and 901.1MB in the end (delta: 207.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:21:08,190 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.23ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.16ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 94.3MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.49ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 89.8MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.77ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 84.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 666.46ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 50.1MB in the end (delta: 34.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30160.18ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 49.1MB in the beginning and 901.3MB in the end (delta: -852.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 981.5MB. Free memory was 901.3MB in the beginning and 901.1MB in the end (delta: 207.3kB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 88, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someUnaryDOUBLEoperation at line 26. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L25-L27] float float_Array_0[3] = { 9.125, 50.5, -0.6 }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L28-L30] unsigned short int unsigned_short_int_Array_0[2][3] = { {8, 32, 200}, {1, 56955, 10} }; [L31] unsigned short int last_1_unsigned_short_int_Array_0_0__0_ = 8; [L32] unsigned short int last_1_unsigned_short_int_Array_0_1__2_ = 10; [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L84] EXPR unsigned_short_int_Array_0[0][0] [L84] last_1_unsigned_short_int_Array_0_0__0_ = unsigned_short_int_Array_0[0][0] [L85] EXPR unsigned_short_int_Array_0[1][2] [L85] last_1_unsigned_short_int_Array_0_1__2_ = unsigned_short_int_Array_0[1][2] [L95] RET updateLastVariables() [L96] CALL updateVariables() [L63] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L64] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L65] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L66] float_Array_0[0] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[0] [L67] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L67] EXPR float_Array_0[0] [L67] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L67] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L68] float_Array_0[1] = __VERIFIER_nondet_float() [L69] EXPR float_Array_0[1] [L69] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L69] EXPR float_Array_0[1] [L69] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L69] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L70] unsigned_short_int_Array_0[1][0] = __VERIFIER_nondet_ushort() [L71] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L71] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L71] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L72] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L72] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L72] RET assume_abort_if_not(unsigned_short_int_Array_0[1][0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L73] unsigned_short_int_Array_0[0][1] = __VERIFIER_nondet_ushort() [L74] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L74] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L74] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L75] EXPR unsigned_short_int_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L75] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L75] RET assume_abort_if_not(unsigned_short_int_Array_0[0][1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L76] unsigned_short_int_Array_0[1][1] = __VERIFIER_nondet_ushort() [L77] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L77] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L77] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L78] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L78] CALL assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L78] RET assume_abort_if_not(unsigned_short_int_Array_0[1][1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L79] unsigned_short_int_Array_0[0][2] = __VERIFIER_nondet_ushort() [L80] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L80] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L80] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L81] EXPR unsigned_short_int_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L81] CALL assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L81] RET assume_abort_if_not(unsigned_short_int_Array_0[0][2] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L96] RET updateVariables() [L97] CALL step() [L36] COND TRUE last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_) [L37] EXPR unsigned_short_int_Array_0[0][2] [L37] EXPR unsigned_short_int_Array_0[1][1] [L37] EXPR unsigned_short_int_Array_0[0][1] [L37] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L37] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) [L37] EXPR unsigned_short_int_Array_0[1][0] [L37] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L37] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) [L37] EXPR unsigned_short_int_Array_0[0][2] [L37] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L37] unsigned_short_int_Array_0[1][2] = ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))) [L39] EXPR BOOL_unsigned_char_Array_0[0] [L39] BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L39] BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) [L39] EXPR unsigned_short_int_Array_0[1][1] [L39] EXPR unsigned_short_int_Array_0[1][0] [L39] BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L39] COND FALSE !(BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) [L50] EXPR unsigned_short_int_Array_0[1][1] [L50] unsigned_short_int_Array_0[0][0] = unsigned_short_int_Array_0[1][1] [L52] EXPR unsigned_short_int_Array_0[0][1] [L52] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L52] COND FALSE !(unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) [L59] EXPR float_Array_0[0] [L59] float_Array_0[2] = float_Array_0[0] [L97] RET step() [L98] CALL, EXPR property() [L88] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1 [L88] EXPR unsigned_short_int_Array_0[1][2] [L88] EXPR unsigned_short_int_Array_0[0][2] [L88] EXPR unsigned_short_int_Array_0[1][1] [L88] EXPR unsigned_short_int_Array_0[0][1] [L88] EXPR unsigned_short_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) [L88] EXPR unsigned_short_int_Array_0[1][0] [L88] EXPR (((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) [L88] EXPR unsigned_short_int_Array_0[0][2] [L88] EXPR ((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1]))) [L88] EXPR BOOL_unsigned_char_Array_0[0] [L88] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) [L88] EXPR unsigned_short_int_Array_0[1][1] [L88] EXPR unsigned_short_int_Array_0[1][0] [L88] EXPR BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])) [L88] EXPR unsigned_short_int_Array_0[0][0] [L88] EXPR unsigned_short_int_Array_0[1][1] [L88] EXPR (BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR ((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) [L88] EXPR unsigned_short_int_Array_0[0][1] [L88] EXPR unsigned_short_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0])) [L88] EXPR float_Array_0[2] [L88] EXPR float_Array_0[0] [L88] EXPR (unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88] EXPR (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L88-L89] return (((last_1_unsigned_short_int_Array_0_0__0_ <= (last_1_unsigned_short_int_Array_0_0__0_ * last_1_unsigned_short_int_Array_0_1__2_)) ? (unsigned_short_int_Array_0[1][2] == ((unsigned short int) ((((unsigned_short_int_Array_0[0][2]) > ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0]))))) ? (unsigned_short_int_Array_0[0][2]) : ((((((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) > (unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] - unsigned_short_int_Array_0[0][1])) : (unsigned_short_int_Array_0[1][0])))))))) : 1) && ((BOOL_unsigned_char_Array_0[0] || (unsigned_short_int_Array_0[1][1] == unsigned_short_int_Array_0[1][0])) ? ((unsigned_short_int_Array_0[1][1] <= (((((0) < (unsigned_short_int_Array_0[1][2])) ? (0) : (unsigned_short_int_Array_0[1][2]))) << unsigned_short_int_Array_0[1][2])) ? ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[1][2] == (unsigned_short_int_Array_0[1][1] * unsigned_short_int_Array_0[0][2]))) ? (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2])) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[0][2]))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) 2))) : (unsigned_short_int_Array_0[0][0] == ((unsigned short int) unsigned_short_int_Array_0[1][1])))) && ((unsigned_short_int_Array_0[0][1] != unsigned_short_int_Array_0[1][1]) ? ((unsigned_short_int_Array_0[0][1] <= unsigned_short_int_Array_0[0][0]) ? (float_Array_0[2] == ((float) ((((float_Array_0[0]) > (float_Array_0[1])) ? (float_Array_0[0]) : (float_Array_0[1]))))) : (float_Array_0[2] == ((float) float_Array_0[0]))) : (float_Array_0[2] == ((float) float_Array_0[0]))) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0__0_=8, last_1_unsigned_short_int_Array_0_1__2_=10, unsigned_short_int_Array_0={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 159 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.1s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2635 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2597 mSDsluCounter, 21189 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17737 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10982 IncrementalHoareTripleChecker+Invalid, 11148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 3452 mSDtfsCounter, 10982 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 668 GetRequests, 471 SyntacticMatches, 6 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1095occurred in iteration=17, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 2308 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 2673 NumberOfCodeBlocks, 2673 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2335 ConstructedInterpolants, 0 QuantifiedInterpolants, 11390 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1008 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 6017/6072 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:21:08,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-2.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 6c2afc665f9ec9bbf6f489827c9a63486fda067f850cc8b511cbd83d8b773bd8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:21:10,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:21:10,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:21:10,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:21:10,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:21:10,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:21:10,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:21:10,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:21:10,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:21:10,473 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:21:10,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:21:10,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:21:10,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:21:10,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:21:10,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:21:10,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:10,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:21:10,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:21:10,475 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 -> 6c2afc665f9ec9bbf6f489827c9a63486fda067f850cc8b511cbd83d8b773bd8 [2025-03-17 05:21:10,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:21:10,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:21:10,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:21:10,734 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:21:10,734 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:21:10,735 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-2.i [2025-03-17 05:21:11,977 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1547383eb/631baaebb2fd4bf19b5b216b24fed3af/FLAGd2ff8d467 [2025-03-17 05:21:12,171 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:21:12,172 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-2.i [2025-03-17 05:21:12,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1547383eb/631baaebb2fd4bf19b5b216b24fed3af/FLAGd2ff8d467 [2025-03-17 05:21:12,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1547383eb/631baaebb2fd4bf19b5b216b24fed3af [2025-03-17 05:21:12,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:21:12,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:21:12,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:21:12,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:21:12,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:21:12,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:21:12" (1/1) ... [2025-03-17 05:21:12,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21013b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:12, skipping insertion in model container [2025-03-17 05:21:12,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:21:12" (1/1) ... [2025-03-17 05:21:12,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:21:12,367 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-2.i[915,928] [2025-03-17 05:21:12,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:21:12,465 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:21:12,476 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-2.i[915,928] [2025-03-17 05:21:12,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:21:12,566 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:21:12,567 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:12 WrapperNode [2025-03-17 05:21:12,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:21:12,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:21:12,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:21:12,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:21:12,575 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:12" (1/1) ... [2025-03-17 05:21:12,597 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:12" (1/1) ... [2025-03-17 05:21:12,636 INFO L138 Inliner]: procedures = 33, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2025-03-17 05:21:12,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:21:12,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:21:12,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:21:12,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:21:12,645 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:12" (1/1) ... [2025-03-17 05:21:12,646 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:12" (1/1) ... [2025-03-17 05:21:12,652 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:12" (1/1) ... [2025-03-17 05:21:12,680 INFO L175 MemorySlicer]: Split 131 memory accesses to 4 slices as follows [2, 8, 31, 90]. 69 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 3, 6]. The 15 writes are split as follows [0, 1, 5, 9]. [2025-03-17 05:21:12,684 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:12" (1/1) ... [2025-03-17 05:21:12,685 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:12" (1/1) ... [2025-03-17 05:21:12,709 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:12" (1/1) ... [2025-03-17 05:21:12,714 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:12" (1/1) ... [2025-03-17 05:21:12,717 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:12" (1/1) ... [2025-03-17 05:21:12,722 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:12" (1/1) ... [2025-03-17 05:21:12,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:21:12,733 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:21:12,734 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:21:12,734 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:21:12,735 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:12" (1/1) ... [2025-03-17 05:21:12,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:21:12,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:21:12,762 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:12,764 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:12,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:21:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:21:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:21:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:21:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:21:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:21:12,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:21:12,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:21:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:21:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:21:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:21:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:21:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:21:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:21:12,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:21:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:21:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:21:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:21:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:21:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:21:12,787 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:21:12,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:21:12,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:21:12,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:21:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:21:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:21:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:21:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:21:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:21:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:21:12,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:21:12,907 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:21:12,909 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:21:13,570 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L88: havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite98#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite97#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite124#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite121#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite141#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-03-17 05:21:13,612 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-03-17 05:21:13,612 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:21:13,623 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:21:13,623 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:21:13,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:13 BoogieIcfgContainer [2025-03-17 05:21:13,624 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:21:13,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:21:13,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:21:13,630 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:21:13,630 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:21:12" (1/3) ... [2025-03-17 05:21:13,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab45b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:13, skipping insertion in model container [2025-03-17 05:21:13,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:21:12" (2/3) ... [2025-03-17 05:21:13,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab45b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:13, skipping insertion in model container [2025-03-17 05:21:13,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:13" (3/3) ... [2025-03-17 05:21:13,633 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-2.i [2025-03-17 05:21:13,646 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:21:13,647 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-2.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:21:13,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:21:13,696 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;@102a3a27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:21:13,696 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:21:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:21:13,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:21:13,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:13,710 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,710 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:13,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:13,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1646684553, now seen corresponding path program 1 times [2025-03-17 05:21:13,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:13,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988960270] [2025-03-17 05:21:13,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:13,725 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:21:13,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:13,731 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:21:13,733 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:21:13,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:21:13,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:21:13,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:13,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:14,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:21:14,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-17 05:21:14,036 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:14,037 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:14,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988960270] [2025-03-17 05:21:14,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988960270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:14,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:14,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:21:14,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863703854] [2025-03-17 05:21:14,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:14,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:21:14,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:14,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:21:14,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:21:14,059 INFO L87 Difference]: Start difference. First operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:21:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:14,074 INFO L93 Difference]: Finished difference Result 185 states and 292 transitions. [2025-03-17 05:21:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:21:14,076 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2025-03-17 05:21:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:14,079 INFO L225 Difference]: With dead ends: 185 [2025-03-17 05:21:14,080 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:21:14,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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:14,083 INFO L435 NwaCegarLoop]: 137 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, 137 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:14,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 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:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:21:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 05:21:14,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:21:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2025-03-17 05:21:14,116 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 96 [2025-03-17 05:21:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:14,117 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2025-03-17 05:21:14,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:21:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2025-03-17 05:21:14,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:21:14,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:14,119 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,125 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:21:14,320 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:21:14,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:14,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:14,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1662600371, now seen corresponding path program 1 times [2025-03-17 05:21:14,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:14,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982078232] [2025-03-17 05:21:14,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:14,322 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:21:14,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:14,323 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:21:14,325 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:21:14,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:21:14,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:21:14,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:14,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:14,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:21:14,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:14,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:14,620 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 37 treesize of output 17 [2025-03-17 05:21:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:15,085 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:15,086 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:15,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982078232] [2025-03-17 05:21:15,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982078232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:15,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:15,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:21:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936599509] [2025-03-17 05:21:15,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:15,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:21:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:15,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:21:15,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:21:15,088 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:15,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:15,424 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2025-03-17 05:21:15,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:21:15,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 96 [2025-03-17 05:21:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:15,427 INFO L225 Difference]: With dead ends: 275 [2025-03-17 05:21:15,427 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 05:21:15,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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:15,428 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 118 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:15,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 340 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:21:15,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 05:21:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 152. [2025-03-17 05:21:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 125 states have (on average 1.424) internal successors, (178), 125 states have internal predecessors, (178), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:21:15,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 226 transitions. [2025-03-17 05:21:15,459 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 226 transitions. Word has length 96 [2025-03-17 05:21:15,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:15,460 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 226 transitions. [2025-03-17 05:21:15,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2025-03-17 05:21:15,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:21:15,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:15,462 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,469 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:21:15,663 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:21:15,663 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:15,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash -350929120, now seen corresponding path program 1 times [2025-03-17 05:21:15,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:15,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946427602] [2025-03-17 05:21:15,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:15,664 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:21:15,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:15,666 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:21:15,667 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:21:15,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:21:15,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:21:15,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:15,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:15,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:21:15,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:15,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:15,904 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 40 treesize of output 16 [2025-03-17 05:21:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:15,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:15,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946427602] [2025-03-17 05:21:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946427602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:15,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:15,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:15,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30416843] [2025-03-17 05:21:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:15,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:21:15,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:15,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:21:15,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:21:15,938 INFO L87 Difference]: Start difference. First operand 152 states and 226 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:16,298 INFO L93 Difference]: Finished difference Result 305 states and 450 transitions. [2025-03-17 05:21:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:21:16,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2025-03-17 05:21:16,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:16,300 INFO L225 Difference]: With dead ends: 305 [2025-03-17 05:21:16,300 INFO L226 Difference]: Without dead ends: 214 [2025-03-17 05:21:16,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 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:21:16,301 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 82 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:16,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 498 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:21:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-17 05:21:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2025-03-17 05:21:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 177 states have (on average 1.4180790960451977) internal successors, (251), 178 states have internal predecessors, (251), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:21:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2025-03-17 05:21:16,331 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 102 [2025-03-17 05:21:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:16,331 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2025-03-17 05:21:16,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:16,331 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2025-03-17 05:21:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:21:16,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:16,333 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,340 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:21:16,533 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:21:16,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:16,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:16,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2147086817, now seen corresponding path program 1 times [2025-03-17 05:21:16,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:16,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008352881] [2025-03-17 05:21:16,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:16,535 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:21:16,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:16,540 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:21:16,541 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:21:16,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:21:16,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:21:16,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:16,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:16,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:21:16,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:16,782 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:21:16,846 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 26 treesize of output 25 [2025-03-17 05:21:17,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:17,109 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 47 treesize of output 43 [2025-03-17 05:21:17,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:17,583 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 85 treesize of output 57 [2025-03-17 05:21:17,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:17,687 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 85 treesize of output 66 [2025-03-17 05:21:17,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:17,862 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 80 treesize of output 40 [2025-03-17 05:21:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 151 proven. 18 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-03-17 05:21:17,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:21:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:18,171 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:18,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008352881] [2025-03-17 05:21:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008352881] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:18,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:18,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 19 [2025-03-17 05:21:18,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992115866] [2025-03-17 05:21:18,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:18,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:21:18,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:18,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:21:18,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:21:18,172 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:18,618 INFO L93 Difference]: Finished difference Result 461 states and 679 transitions. [2025-03-17 05:21:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:21:18,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2025-03-17 05:21:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:18,622 INFO L225 Difference]: With dead ends: 461 [2025-03-17 05:21:18,622 INFO L226 Difference]: Without dead ends: 311 [2025-03-17 05:21:18,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:21:18,624 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 194 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:18,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 372 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:21:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-17 05:21:18,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 254. [2025-03-17 05:21:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 219 states have (on average 1.4383561643835616) internal successors, (315), 220 states have internal predecessors, (315), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:21:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2025-03-17 05:21:18,649 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 102 [2025-03-17 05:21:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:18,649 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2025-03-17 05:21:18,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2025-03-17 05:21:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:21:18,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:18,651 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,659 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:21:18,856 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:21:18,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:18,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:18,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1936529566, now seen corresponding path program 1 times [2025-03-17 05:21:18,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:18,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691763520] [2025-03-17 05:21:18,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:18,857 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:21:18,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:18,860 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:21:18,862 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:21:18,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:21:19,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:21:19,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:19,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:19,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:21:19,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:19,082 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:21:19,091 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 23 [2025-03-17 05:21:19,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:19,116 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 39 treesize of output 44 [2025-03-17 05:21:19,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:19,230 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 56 treesize of output 22 [2025-03-17 05:21:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:19,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:19,296 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:19,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691763520] [2025-03-17 05:21:19,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691763520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:19,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:19,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:21:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113782865] [2025-03-17 05:21:19,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:19,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:21:19,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:19,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:21:19,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:19,299 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:20,453 INFO L93 Difference]: Finished difference Result 776 states and 1144 transitions. [2025-03-17 05:21:20,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:21:20,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2025-03-17 05:21:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:20,456 INFO L225 Difference]: With dead ends: 776 [2025-03-17 05:21:20,456 INFO L226 Difference]: Without dead ends: 608 [2025-03-17 05:21:20,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:21:20,459 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 205 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:20,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1126 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:21:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-17 05:21:20,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602. [2025-03-17 05:21:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 533 states have (on average 1.4315196998123827) internal successors, (763), 538 states have internal predecessors, (763), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 55 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-17 05:21:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 883 transitions. [2025-03-17 05:21:20,496 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 883 transitions. Word has length 102 [2025-03-17 05:21:20,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:20,496 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 883 transitions. [2025-03-17 05:21:20,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:20,497 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 883 transitions. [2025-03-17 05:21:20,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:21:20,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:20,498 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,512 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:21:20,699 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:21:20,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:20,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1479975263, now seen corresponding path program 1 times [2025-03-17 05:21:20,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:20,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644150346] [2025-03-17 05:21:20,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:20,700 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:21:20,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:20,705 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:21:20,710 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:21:20,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:21:20,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:21:20,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:20,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:20,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:21:20,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:20,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:20,928 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 62 treesize of output 26 [2025-03-17 05:21:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:21,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:21,001 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:21,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644150346] [2025-03-17 05:21:21,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644150346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:21,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:21,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658535426] [2025-03-17 05:21:21,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:21,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:21:21,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:21,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:21:21,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:21:21,002 INFO L87 Difference]: Start difference. First operand 602 states and 883 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:25,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:21:25,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:25,617 INFO L93 Difference]: Finished difference Result 1329 states and 1941 transitions. [2025-03-17 05:21:25,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:21:25,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:21:25,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:25,625 INFO L225 Difference]: With dead ends: 1329 [2025-03-17 05:21:25,626 INFO L226 Difference]: Without dead ends: 844 [2025-03-17 05:21:25,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:25,628 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 101 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:25,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 526 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-03-17 05:21:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2025-03-17 05:21:25,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 838. [2025-03-17 05:21:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 747 states have (on average 1.428380187416332) internal successors, (1067), 756 states have internal predecessors, (1067), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 67 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:21:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1219 transitions. [2025-03-17 05:21:25,672 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1219 transitions. Word has length 104 [2025-03-17 05:21:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:25,673 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1219 transitions. [2025-03-17 05:21:25,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:25,673 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1219 transitions. [2025-03-17 05:21:25,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:21:25,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:25,674 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,682 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 (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:21:25,874 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:21:25,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:25,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1691326176, now seen corresponding path program 1 times [2025-03-17 05:21:25,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:25,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169414825] [2025-03-17 05:21:25,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:25,877 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:21:25,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:25,879 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:21:25,880 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:21:25,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:21:26,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:21:26,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:26,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:26,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-17 05:21:26,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:26,121 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:21:26,126 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 19 treesize of output 1 [2025-03-17 05:21:26,132 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 19 treesize of output 1 [2025-03-17 05:21:26,136 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:21:26,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:26,316 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 50 treesize of output 31 [2025-03-17 05:21:26,376 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:26,377 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 50 treesize of output 49 [2025-03-17 05:21:26,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:26,524 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 67 treesize of output 27 [2025-03-17 05:21:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-17 05:21:26,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:26,563 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:26,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169414825] [2025-03-17 05:21:26,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169414825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:26,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:26,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:21:26,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394724550] [2025-03-17 05:21:26,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:26,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:21:26,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:26,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:21:26,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:26,564 INFO L87 Difference]: Start difference. First operand 838 states and 1219 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:21:28,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:28,536 INFO L93 Difference]: Finished difference Result 1673 states and 2430 transitions. [2025-03-17 05:21:28,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:21:28,537 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2025-03-17 05:21:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:28,543 INFO L225 Difference]: With dead ends: 1673 [2025-03-17 05:21:28,543 INFO L226 Difference]: Without dead ends: 971 [2025-03-17 05:21:28,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:21:28,546 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 370 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:28,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 701 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-17 05:21:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-03-17 05:21:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 860. [2025-03-17 05:21:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 769 states have (on average 1.4278283485045513) internal successors, (1098), 778 states have internal predecessors, (1098), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 67 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:21:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1250 transitions. [2025-03-17 05:21:28,599 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1250 transitions. Word has length 104 [2025-03-17 05:21:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:28,600 INFO L471 AbstractCegarLoop]: Abstraction has 860 states and 1250 transitions. [2025-03-17 05:21:28,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:21:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1250 transitions. [2025-03-17 05:21:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:21:28,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:28,601 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,616 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 (8)] Ended with exit code 0 [2025-03-17 05:21:28,801 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:21:28,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:28,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1314845439, now seen corresponding path program 1 times [2025-03-17 05:21:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:28,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047240563] [2025-03-17 05:21:28,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:28,802 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:21:28,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:28,804 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:21:28,806 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:21:28,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:21:28,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:21:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:28,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:21:28,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:29,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:29,076 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 62 treesize of output 26 [2025-03-17 05:21:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:29,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:29,173 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:29,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047240563] [2025-03-17 05:21:29,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047240563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:29,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:29,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:29,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291106101] [2025-03-17 05:21:29,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:29,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:21:29,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:29,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:21:29,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:21:29,174 INFO L87 Difference]: Start difference. First operand 860 states and 1250 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:34,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:21:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:35,126 INFO L93 Difference]: Finished difference Result 2073 states and 3011 transitions. [2025-03-17 05:21:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:21:35,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:21:35,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:35,134 INFO L225 Difference]: With dead ends: 2073 [2025-03-17 05:21:35,135 INFO L226 Difference]: Without dead ends: 1358 [2025-03-17 05:21:35,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:35,138 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 73 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:35,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 497 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2025-03-17 05:21:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2025-03-17 05:21:35,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 865. [2025-03-17 05:21:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 774 states have (on average 1.425064599483204) internal successors, (1103), 783 states have internal predecessors, (1103), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 67 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:21:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1255 transitions. [2025-03-17 05:21:35,179 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1255 transitions. Word has length 104 [2025-03-17 05:21:35,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:35,180 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1255 transitions. [2025-03-17 05:21:35,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:35,181 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1255 transitions. [2025-03-17 05:21:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:21:35,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:35,185 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,192 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:21:35,385 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:21:35,386 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:35,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:35,386 INFO L85 PathProgramCache]: Analyzing trace with hash -482105920, now seen corresponding path program 1 times [2025-03-17 05:21:35,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:35,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135253269] [2025-03-17 05:21:35,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:35,387 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:21:35,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:35,389 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:21:35,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 (10)] Waiting until timeout for monitored process [2025-03-17 05:21:35,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:21:35,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:21:35,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:35,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:35,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-17 05:21:35,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:35,660 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:21:35,859 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 25 treesize of output 24 [2025-03-17 05:21:36,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:36,181 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 40 treesize of output 27 [2025-03-17 05:21:36,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:36,460 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 40 treesize of output 27 [2025-03-17 05:21:37,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:37,050 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 59 treesize of output 43 [2025-03-17 05:21:37,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:37,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 59 treesize of output 61 [2025-03-17 05:21:37,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:37,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 30 [2025-03-17 05:21:37,801 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-17 05:21:37,801 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:37,801 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:37,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135253269] [2025-03-17 05:21:37,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135253269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:37,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:37,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:21:37,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424899953] [2025-03-17 05:21:37,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:37,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:21:37,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:37,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:21:37,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:21:37,802 INFO L87 Difference]: Start difference. First operand 865 states and 1255 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:21:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:42,213 INFO L93 Difference]: Finished difference Result 1692 states and 2450 transitions. [2025-03-17 05:21:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:21:42,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-03-17 05:21:42,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:42,217 INFO L225 Difference]: With dead ends: 1692 [2025-03-17 05:21:42,217 INFO L226 Difference]: Without dead ends: 972 [2025-03-17 05:21:42,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:21:42,219 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 381 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:42,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 819 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-17 05:21:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2025-03-17 05:21:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 869. [2025-03-17 05:21:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 777 states have (on average 1.422136422136422) internal successors, (1105), 786 states have internal predecessors, (1105), 76 states have call successors, (76), 15 states have call predecessors, (76), 15 states have return successors, (76), 67 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:21:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1257 transitions. [2025-03-17 05:21:42,250 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1257 transitions. Word has length 104 [2025-03-17 05:21:42,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:42,251 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1257 transitions. [2025-03-17 05:21:42,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:21:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1257 transitions. [2025-03-17 05:21:42,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:21:42,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:42,252 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,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 (10)] Ended with exit code 0 [2025-03-17 05:21:42,454 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:21:42,454 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:42,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:42,455 INFO L85 PathProgramCache]: Analyzing trace with hash 976562466, now seen corresponding path program 1 times [2025-03-17 05:21:42,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:42,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821005135] [2025-03-17 05:21:42,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:42,455 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:21:42,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:42,457 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:21:42,459 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:21:42,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:21:42,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:21:42,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:42,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:42,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:21:42,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:42,727 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 19 treesize of output 1 [2025-03-17 05:21:42,891 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 26 treesize of output 25 [2025-03-17 05:21:43,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:43,221 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 36 treesize of output 38 [2025-03-17 05:21:43,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:43,891 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 51 treesize of output 41 [2025-03-17 05:21:44,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:44,007 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 51 treesize of output 50 [2025-03-17 05:21:44,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:44,696 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 85 treesize of output 35 [2025-03-17 05:21:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 153 proven. 12 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-17 05:21:44,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:21:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:21:45,764 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:45,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821005135] [2025-03-17 05:21:45,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821005135] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:21:45,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:21:45,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2025-03-17 05:21:45,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596292606] [2025-03-17 05:21:45,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:45,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:45,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:45,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:45,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:21:45,765 INFO L87 Difference]: Start difference. First operand 869 states and 1257 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:48,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:48,045 INFO L93 Difference]: Finished difference Result 2229 states and 3212 transitions. [2025-03-17 05:21:48,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:21:48,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:21:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:48,061 INFO L225 Difference]: With dead ends: 2229 [2025-03-17 05:21:48,061 INFO L226 Difference]: Without dead ends: 1509 [2025-03-17 05:21:48,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:21:48,063 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 240 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:48,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 533 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-17 05:21:48,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-03-17 05:21:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 892. [2025-03-17 05:21:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 799 states have (on average 1.4192740926157696) internal successors, (1134), 808 states have internal predecessors, (1134), 76 states have call successors, (76), 16 states have call predecessors, (76), 16 states have return successors, (76), 67 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-17 05:21:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1286 transitions. [2025-03-17 05:21:48,118 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1286 transitions. Word has length 105 [2025-03-17 05:21:48,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:48,119 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1286 transitions. [2025-03-17 05:21:48,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:21:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1286 transitions. [2025-03-17 05:21:48,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:21:48,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:48,122 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,134 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