./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.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-p_file-42.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 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:46:11,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:46:12,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:46:12,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:46:12,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:46:12,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:46:12,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:46:12,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:46:12,064 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:46:12,064 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:46:12,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:46:12,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:46:12,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:46:12,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:46:12,066 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:46:12,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:46:12,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:46:12,066 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:46:12,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:46:12,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:46:12,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:46:12,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:46:12,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:46:12,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:46:12,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:46:12,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:46:12,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:46:12,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:46:12,067 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:46:12,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:46:12,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:46:12,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:46:12,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:12,068 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:46:12,068 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:46:12,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:46:12,069 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:46:12,069 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:46:12,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:46:12,069 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:46:12,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:46:12,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:46:12,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:46:12,069 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 -> 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3 [2025-03-17 05:46:12,319 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:46:12,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:46:12,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:46:12,330 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:46:12,330 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:46:12,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i [2025-03-17 05:46:13,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63beaa9db/c5d504577012422688f423cdd4c8ec63/FLAG2f6ddb631 [2025-03-17 05:46:13,862 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:46:13,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i [2025-03-17 05:46:13,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63beaa9db/c5d504577012422688f423cdd4c8ec63/FLAG2f6ddb631 [2025-03-17 05:46:14,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63beaa9db/c5d504577012422688f423cdd4c8ec63 [2025-03-17 05:46:14,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:46:14,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:46:14,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:14,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:46:14,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:46:14,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,149 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a252bd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14, skipping insertion in model container [2025-03-17 05:46:14,149 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:46:14,277 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-p_file-42.i[916,929] [2025-03-17 05:46:14,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:14,345 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:46:14,355 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-p_file-42.i[916,929] [2025-03-17 05:46:14,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:14,407 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:46:14,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14 WrapperNode [2025-03-17 05:46:14,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:14,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:14,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:46:14,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:46:14,416 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:46:14" (1/1) ... [2025-03-17 05:46:14,432 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:46:14" (1/1) ... [2025-03-17 05:46:14,460 INFO L138 Inliner]: procedures = 29, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2025-03-17 05:46:14,460 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:14,461 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:46:14,461 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:46:14,461 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:46:14,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,469 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,488 INFO L175 MemorySlicer]: Split 115 memory accesses to 12 slices as follows [2, 9, 35, 8, 7, 14, 5, 6, 6, 8, 9, 6]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1]. [2025-03-17 05:46:14,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,505 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,525 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:46:14,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:46:14,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:46:14,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:46:14,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (1/1) ... [2025-03-17 05:46:14,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:14,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:14,557 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:46:14,561 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:46:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:46:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:46:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:46:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:46:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:46:14,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:46:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:46:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:46:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:46:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:46:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:46:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-17 05:46:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-17 05:46:14,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-17 05:46:14,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:46:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:46:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:46:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:46:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:46:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:46:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:46:14,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:46:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:46:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:46:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-17 05:46:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-17 05:46:14,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:46:14,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:46:14,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-17 05:46:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:46:14,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:46:14,745 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:46:14,746 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:46:15,088 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2025-03-17 05:46:15,125 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-17 05:46:15,126 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:46:15,137 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:46:15,139 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:46:15,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:15 BoogieIcfgContainer [2025-03-17 05:46:15,140 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:46:15,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:46:15,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:46:15,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:46:15,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:46:14" (1/3) ... [2025-03-17 05:46:15,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709a25b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:15, skipping insertion in model container [2025-03-17 05:46:15,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:14" (2/3) ... [2025-03-17 05:46:15,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709a25b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:15, skipping insertion in model container [2025-03-17 05:46:15,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:15" (3/3) ... [2025-03-17 05:46:15,148 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-42.i [2025-03-17 05:46:15,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:46:15,162 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-42.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:46:15,212 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:46:15,220 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;@33a4124b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:46:15,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:46:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 80 states have (on average 1.4375) internal successors, (115), 81 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:15,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:15,231 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:15,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:15,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:15,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1574367401, now seen corresponding path program 1 times [2025-03-17 05:46:15,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:15,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637756224] [2025-03-17 05:46:15,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:15,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:15,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:15,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:15,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:46:15,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:15,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637756224] [2025-03-17 05:46:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637756224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116898606] [2025-03-17 05:46:15,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:15,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:15,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:15,490 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:46:15,491 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:46:15,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:15,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:15,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:15,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:15,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:46:15,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:15,747 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:46:15,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:15,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116898606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:15,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:15,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:46:15,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198977210] [2025-03-17 05:46:15,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:15,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:46:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:15,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:46:15,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:15,767 INFO L87 Difference]: Start difference. First operand has 94 states, 80 states have (on average 1.4375) internal successors, (115), 81 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:46:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:15,785 INFO L93 Difference]: Finished difference Result 185 states and 283 transitions. [2025-03-17 05:46:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:46:15,787 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-17 05:46:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:15,793 INFO L225 Difference]: With dead ends: 185 [2025-03-17 05:46:15,793 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:46:15,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 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:46:15,798 INFO L435 NwaCegarLoop]: 131 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, 131 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:46:15,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:46:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 05:46:15,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2025-03-17 05:46:15,824 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99 [2025-03-17 05:46:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:15,824 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2025-03-17 05:46:15,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:46:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2025-03-17 05:46:15,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:15,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:15,827 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:15,834 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:46:16,028 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:46:16,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:16,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:16,029 INFO L85 PathProgramCache]: Analyzing trace with hash 2077695600, now seen corresponding path program 1 times [2025-03-17 05:46:16,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:16,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352202181] [2025-03-17 05:46:16,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:16,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:16,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:16,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:16,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:16,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:16,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:16,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352202181] [2025-03-17 05:46:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352202181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:16,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:16,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:46:16,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591837854] [2025-03-17 05:46:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:16,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:46:16,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:16,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:46:16,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:16,593 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:16,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:16,645 INFO L93 Difference]: Finished difference Result 181 states and 258 transitions. [2025-03-17 05:46:16,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:46:16,646 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:46:16,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:16,647 INFO L225 Difference]: With dead ends: 181 [2025-03-17 05:46:16,647 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 05:46:16,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:16,648 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:16,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 05:46:16,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 05:46:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:16,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2025-03-17 05:46:16,655 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 99 [2025-03-17 05:46:16,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:16,656 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2025-03-17 05:46:16,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2025-03-17 05:46:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:16,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:16,657 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:16,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:46:16,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:16,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:16,658 INFO L85 PathProgramCache]: Analyzing trace with hash 617089012, now seen corresponding path program 1 times [2025-03-17 05:46:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:16,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272569856] [2025-03-17 05:46:16,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:16,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:16,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:16,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:16,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:16,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:16,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272569856] [2025-03-17 05:46:16,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272569856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:16,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:16,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:46:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515438554] [2025-03-17 05:46:16,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:16,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:46:16,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:16,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:46:16,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:46:16,859 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:16,874 INFO L93 Difference]: Finished difference Result 177 states and 250 transitions. [2025-03-17 05:46:16,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:46:16,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:46:16,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:16,878 INFO L225 Difference]: With dead ends: 177 [2025-03-17 05:46:16,878 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:46:16,879 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:46:16,879 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:16,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 241 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:16,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:46:16,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 05:46:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:16,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 123 transitions. [2025-03-17 05:46:16,890 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 123 transitions. Word has length 99 [2025-03-17 05:46:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:16,890 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 123 transitions. [2025-03-17 05:46:16,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:16,891 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 123 transitions. [2025-03-17 05:46:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:16,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:16,891 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:16,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:46:16,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:16,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash 754238448, now seen corresponding path program 1 times [2025-03-17 05:46:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:16,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000045638] [2025-03-17 05:46:16,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:16,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:16,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:16,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:16,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:16,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:17,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000045638] [2025-03-17 05:46:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000045638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:17,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:17,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:46:17,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27402421] [2025-03-17 05:46:17,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:17,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:46:17,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:17,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:46:17,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:17,238 INFO L87 Difference]: Start difference. First operand 88 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:17,270 INFO L93 Difference]: Finished difference Result 175 states and 245 transitions. [2025-03-17 05:46:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:46:17,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:46:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:17,271 INFO L225 Difference]: With dead ends: 175 [2025-03-17 05:46:17,271 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:46:17,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:17,273 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:17,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:46:17,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 05:46:17,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2025-03-17 05:46:17,280 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 99 [2025-03-17 05:46:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:17,280 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2025-03-17 05:46:17,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2025-03-17 05:46:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:17,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:17,282 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:17,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:46:17,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:17,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:17,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1322970895, now seen corresponding path program 1 times [2025-03-17 05:46:17,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:17,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281630271] [2025-03-17 05:46:17,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:17,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:17,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:17,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:17,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:17,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:17,623 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:17,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281630271] [2025-03-17 05:46:17,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281630271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:17,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:17,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:46:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765186229] [2025-03-17 05:46:17,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:17,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:46:17,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:17,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:46:17,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:17,626 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:17,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:17,658 INFO L93 Difference]: Finished difference Result 175 states and 243 transitions. [2025-03-17 05:46:17,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:46:17,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:46:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:17,660 INFO L225 Difference]: With dead ends: 175 [2025-03-17 05:46:17,660 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:46:17,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:17,661 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:17,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:46:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 05:46:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.32) internal successors, (99), 75 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 121 transitions. [2025-03-17 05:46:17,669 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 121 transitions. Word has length 99 [2025-03-17 05:46:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:17,669 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 121 transitions. [2025-03-17 05:46:17,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2025-03-17 05:46:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:17,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:17,670 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:17,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:46:17,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:17,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:17,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1828529520, now seen corresponding path program 1 times [2025-03-17 05:46:17,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:17,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894216727] [2025-03-17 05:46:17,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:17,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:17,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:17,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894216727] [2025-03-17 05:46:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894216727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:18,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:18,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:46:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193891230] [2025-03-17 05:46:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:18,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:46:18,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:18,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:46:18,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:46:18,133 INFO L87 Difference]: Start difference. First operand 88 states and 121 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:18,219 INFO L93 Difference]: Finished difference Result 178 states and 245 transitions. [2025-03-17 05:46:18,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:46:18,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:46:18,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:18,221 INFO L225 Difference]: With dead ends: 178 [2025-03-17 05:46:18,221 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 05:46:18,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:46:18,222 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 60 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:18,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 411 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 05:46:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-03-17 05:46:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3116883116883118) internal successors, (101), 77 states have internal predecessors, (101), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 123 transitions. [2025-03-17 05:46:18,229 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 123 transitions. Word has length 99 [2025-03-17 05:46:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:18,229 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 123 transitions. [2025-03-17 05:46:18,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:18,230 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 123 transitions. [2025-03-17 05:46:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:18,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:18,235 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:18,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:46:18,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:18,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash 669486417, now seen corresponding path program 1 times [2025-03-17 05:46:18,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:18,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766863277] [2025-03-17 05:46:18,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:18,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:18,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:18,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:18,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:18,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:46:18,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:18,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766863277] [2025-03-17 05:46:18,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766863277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:18,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987597543] [2025-03-17 05:46:18,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:18,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:18,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:18,587 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:46:18,590 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:46:18,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:18,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:18,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:18,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:18,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 05:46:18,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:18,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-17 05:46:18,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:46:18,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 05:46:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:19,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:19,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987597543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:19,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2025-03-17 05:46:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646249545] [2025-03-17 05:46:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:19,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:46:19,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:19,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:46:19,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:46:19,043 INFO L87 Difference]: Start difference. First operand 90 states and 123 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:19,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:19,243 INFO L93 Difference]: Finished difference Result 214 states and 293 transitions. [2025-03-17 05:46:19,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:46:19,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:46:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:19,245 INFO L225 Difference]: With dead ends: 214 [2025-03-17 05:46:19,245 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 05:46:19,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:46:19,246 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 110 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:19,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 927 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 05:46:19,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 88. [2025-03-17 05:46:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.2933333333333332) internal successors, (97), 75 states have internal predecessors, (97), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:19,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 119 transitions. [2025-03-17 05:46:19,256 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 119 transitions. Word has length 99 [2025-03-17 05:46:19,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:19,257 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 119 transitions. [2025-03-17 05:46:19,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 119 transitions. [2025-03-17 05:46:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:46:19,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:19,259 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:19,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:46:19,463 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,SelfDestructingSolverStorable6 [2025-03-17 05:46:19,463 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:19,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:19,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1966381294, now seen corresponding path program 1 times [2025-03-17 05:46:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:19,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363689839] [2025-03-17 05:46:19,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:19,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:46:19,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:46:19,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:19,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:46:19,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:19,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363689839] [2025-03-17 05:46:19,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363689839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:19,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678194635] [2025-03-17 05:46:19,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:19,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:19,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:19,808 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:46:19,811 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:46:19,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:46:20,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:46:20,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:20,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:20,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:46:20,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:20,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:46:20,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2025-03-17 05:46:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 05:46:20,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:20,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2025-03-17 05:46:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:46:20,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678194635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:46:20,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:46:20,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2025-03-17 05:46:20,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270667412] [2025-03-17 05:46:20,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:46:20,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 05:46:20,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:20,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 05:46:20,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:46:20,476 INFO L87 Difference]: Start difference. First operand 88 states and 119 transitions. Second operand has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 6 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2025-03-17 05:46:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:20,707 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2025-03-17 05:46:20,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:46:20,709 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 6 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) Word has length 101 [2025-03-17 05:46:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:20,712 INFO L225 Difference]: With dead ends: 183 [2025-03-17 05:46:20,713 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 05:46:20,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:46:20,715 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 321 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:20,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 460 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 05:46:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2025-03-17 05:46:20,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 78 states have internal predecessors, (99), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 121 transitions. [2025-03-17 05:46:20,726 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 121 transitions. Word has length 101 [2025-03-17 05:46:20,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:20,731 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 121 transitions. [2025-03-17 05:46:20,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 6 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (23), 4 states have call predecessors, (23), 6 states have call successors, (23) [2025-03-17 05:46:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 121 transitions. [2025-03-17 05:46:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:46:20,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:20,732 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:20,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:46:20,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:20,933 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:20,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:20,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1730528153, now seen corresponding path program 1 times [2025-03-17 05:46:20,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:20,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35318284] [2025-03-17 05:46:20,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:20,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:20,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:46:21,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:46:21,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:21,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:46:21,014 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:46:21,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:46:21,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:46:21,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:21,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:46:21,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:46:21,118 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:46:21,118 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:46:21,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:46:21,121 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:21,259 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:46:21,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:46:21 BoogieIcfgContainer [2025-03-17 05:46:21,265 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:46:21,266 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:46:21,266 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:46:21,266 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:46:21,266 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:15" (3/4) ... [2025-03-17 05:46:21,268 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:46:21,269 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:46:21,270 INFO L158 Benchmark]: Toolchain (without parser) took 7126.08ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 132.0MB in the beginning and 152.8MB in the end (delta: -20.8MB). Peak memory consumption was 61.4MB. Max. memory is 16.1GB. [2025-03-17 05:46:21,271 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:21,271 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.33ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 117.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:46:21,271 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.01ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 114.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:21,272 INFO L158 Benchmark]: Boogie Preprocessor took 67.48ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 109.9MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:46:21,272 INFO L158 Benchmark]: IcfgBuilder took 610.84ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 73.5MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:46:21,272 INFO L158 Benchmark]: TraceAbstraction took 6123.48ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 72.6MB in the beginning and 152.9MB in the end (delta: -80.3MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2025-03-17 05:46:21,272 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 251.7MB. Free memory was 152.9MB in the beginning and 152.8MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:21,274 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.35ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.33ms. Allocated memory is still 167.8MB. Free memory was 131.6MB in the beginning and 117.5MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.01ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 114.1MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 67.48ms. Allocated memory is still 167.8MB. Free memory was 114.1MB in the beginning and 109.9MB in the end (delta: 4.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 610.84ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 73.5MB in the end (delta: 36.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6123.48ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 72.6MB in the beginning and 152.9MB in the end (delta: -80.3MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 251.7MB. Free memory was 152.9MB in the beginning and 152.8MB in the end (delta: 78.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 54, overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -1; [L22] signed long int var_1_1 = -1; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_8 = 5; [L24] unsigned char var_1_8 = 5; [L25] unsigned char* var_1_8_Pointer = &(var_1_8); [L26] unsigned char var_1_9 = 4; [L26] unsigned char var_1_9 = 4; [L27] unsigned char* var_1_9_Pointer = &(var_1_9); [L28] float var_1_10 = 16.5; [L28] float var_1_10 = 16.5; [L29] float* var_1_10_Pointer = &(var_1_10); [L30] float var_1_11 = 127.25; [L30] float var_1_11 = 127.25; [L31] float* var_1_11_Pointer = &(var_1_11); [L32] unsigned char var_1_12 = 1; [L32] unsigned char var_1_12 = 1; [L33] unsigned char* var_1_12_Pointer = &(var_1_12); [L34] unsigned char var_1_13 = 0; [L34] unsigned char var_1_13 = 0; [L35] unsigned char* var_1_13_Pointer = &(var_1_13); [L36] unsigned char var_1_15 = 0; [L36] unsigned char var_1_15 = 0; [L37] unsigned char* var_1_15_Pointer = &(var_1_15); [L38] unsigned char var_1_16 = 0; [L38] unsigned char var_1_16 = 0; [L39] unsigned char* var_1_16_Pointer = &(var_1_16); [L40] unsigned char var_1_17 = 0; [L40] unsigned char var_1_17 = 0; [L41] unsigned char* var_1_17_Pointer = &(var_1_17); [L42] unsigned char var_1_18 = 0; [L42] unsigned char var_1_18 = 0; [L43] unsigned char* var_1_18_Pointer = &(var_1_18); [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] FCALL updateLastVariables() [L101] CALL updateVariables() [L72] var_1_9 = __VERIFIER_nondet_uchar() [L73] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L73] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L73] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] EXPR \read(var_1_9) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] var_1_11 = __VERIFIER_nondet_float() [L76] EXPR \read(var_1_11) [L76] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F [L76] EXPR \read(var_1_11) [L76] EXPR var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] EXPR (var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L77] var_1_13 = __VERIFIER_nondet_uchar() [L78] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L79] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L79] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L79] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] var_1_15 = __VERIFIER_nondet_uchar() [L81] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] var_1_16 = __VERIFIER_nondet_uchar() [L84] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L85] EXPR \read(var_1_16) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L85] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L85] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L86] var_1_18 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_18) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L87] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L87] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L88] EXPR \read(var_1_18) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L88] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L88] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L101] RET updateVariables() [L102] CALL step() [L47] EXPR \read(*var_1_9_Pointer) [L47] (*(var_1_8_Pointer)) = ((*(var_1_9_Pointer)) + 100) [L48] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L48] EXPR (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f) [L48] EXPR \read(*var_1_11_Pointer) [L48] EXPR (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L48] (*(var_1_10_Pointer)) = (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f))) [L49] EXPR \read(*var_1_8_Pointer) [L49] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L49] COND FALSE !((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) [L52] EXPR \read(*var_1_8_Pointer) [L52] EXPR \read(*var_1_8_Pointer) [L52] EXPR \read(*var_1_8_Pointer) [L52] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] EXPR ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) [L52] EXPR \read(*var_1_8_Pointer) [L52] EXPR \read(*var_1_8_Pointer) [L52] EXPR ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] (*(var_1_1_Pointer)) = ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))))) [L54] EXPR \read(*var_1_11_Pointer) [L54] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L54] COND FALSE !((*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))) [L59] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L59] COND TRUE (*(var_1_8_Pointer)) <= 1000000 [L60] (*(var_1_17_Pointer)) = 0 VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L65] EXPR \read(*var_1_10_Pointer) [L65] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L65] COND FALSE !((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) [L68] EXPR \read(*var_1_1_Pointer) [L68] EXPR \read(*var_1_9_Pointer) [L68] EXPR ((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L68] EXPR ((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)) [L68] EXPR \read(*var_1_16_Pointer) [L68] EXPR ((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L68] (*(var_1_12_Pointer)) = (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))) [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))))))) [L93] EXPR \read(*var_1_1_Pointer) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR ((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))))))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR (((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR (((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100))) [L93] EXPR \read(*var_1_8_Pointer) [L93] EXPR \read(*var_1_9_Pointer) [L93] EXPR (((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f))))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f))))) [L93] EXPR \read(*var_1_10_Pointer) [L93] EXPR \read(*var_1_11_Pointer) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f) [L93] EXPR \read(*var_1_11_Pointer) [L93] EXPR (((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f))))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR (((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR (((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer)))))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))) && (((*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) != (*(var_1_8_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) : 1) : (((*(var_1_8_Pointer)) <= 1000000) ? ((*(var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(var_1_17_Pointer)) == ((unsigned char) 0)))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93] EXPR ((((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))) && (((*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) != (*(var_1_8_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) : 1) : (((*(var_1_8_Pointer)) <= 1000000) ? ((*(var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(var_1_17_Pointer)) == ((unsigned char) 0)))) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L93-L94] return ((((((*(var_1_8_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer))) < ((*(var_1_8_Pointer)))) ? ((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))) - 10))) : ((*(var_1_1_Pointer)) == ((signed long int) ((((((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) > (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))) ? (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer)))) : (((*(var_1_8_Pointer)) - (*(var_1_8_Pointer))))))))) && ((*(var_1_8_Pointer)) == ((unsigned char) ((*(var_1_9_Pointer)) + 100)))) && ((*(var_1_10_Pointer)) == ((float) (((((*(var_1_11_Pointer))) < (64.15f)) ? ((*(var_1_11_Pointer))) : (64.15f)))))) && (((- (*(var_1_10_Pointer))) > (*(var_1_11_Pointer))) ? ((*(var_1_12_Pointer)) == ((unsigned char) ((*(var_1_13_Pointer)) || ((*(var_1_17_Pointer)) && ((*(var_1_15_Pointer)) || (*(var_1_16_Pointer))))))) : ((*(var_1_12_Pointer)) == ((unsigned char) (((*(var_1_1_Pointer)) <= (*(var_1_9_Pointer))) && (*(var_1_16_Pointer))))))) && (((*(var_1_11_Pointer)) <= (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) != (*(var_1_8_Pointer))) ? ((*(var_1_17_Pointer)) == ((unsigned char) (*(var_1_18_Pointer)))) : 1) : (((*(var_1_8_Pointer)) <= 1000000) ? ((*(var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(var_1_17_Pointer)) == ((unsigned char) 0)))) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_15={11:0}, var_1_15_Pointer={11:0}, var_1_16={12:0}, var_1_16_Pointer={12:0}, var_1_17={13:0}, var_1_17_Pointer={13:0}, var_1_18={14:0}, var_1_18_Pointer={14:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 148 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.9s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 491 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 491 mSDsluCounter, 3211 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2240 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 451 IncrementalHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 971 mSDtfsCounter, 451 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 404 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 42 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1194 NumberOfCodeBlocks, 1194 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1182 ConstructedInterpolants, 0 QuantifiedInterpolants, 3285 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1445 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 2436/2640 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:46:21,294 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-p_file-42.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 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:46:23,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:46:23,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:46:23,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:46:23,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:46:23,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:46:23,373 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:46:23,374 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:46:23,374 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:46:23,374 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:46:23,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:46:23,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:46:23,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:46:23,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:46:23,376 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:46:23,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:46:23,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:46:23,376 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:46:23,377 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:46:23,378 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:46:23,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:46:23,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:46:23,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:46:23,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:46:23,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:23,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:46:23,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:46:23,379 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:46:23,379 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:46:23,379 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:46:23,379 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:46:23,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:46:23,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:46:23,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:46:23,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:46:23,379 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 -> 998af785ff4fae0c3f310b9fe3b87371c69c6b583b1eb526ab6adc9853d45ab3 [2025-03-17 05:46:23,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:46:23,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:46:23,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:46:23,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:46:23,630 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:46:23,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i [2025-03-17 05:46:24,792 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98327231/9ad28df29a914c83ba6b889a71243946/FLAG1042bcbd2 [2025-03-17 05:46:25,004 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:46:25,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-42.i [2025-03-17 05:46:25,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98327231/9ad28df29a914c83ba6b889a71243946/FLAG1042bcbd2 [2025-03-17 05:46:25,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e98327231/9ad28df29a914c83ba6b889a71243946 [2025-03-17 05:46:25,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:46:25,364 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:46:25,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:25,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:46:25,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:46:25,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68e2f8c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25, skipping insertion in model container [2025-03-17 05:46:25,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,387 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:46:25,501 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-p_file-42.i[916,929] [2025-03-17 05:46:25,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:25,551 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:46:25,559 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-p_file-42.i[916,929] [2025-03-17 05:46:25,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:25,595 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:46:25,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25 WrapperNode [2025-03-17 05:46:25,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:25,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:25,597 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:46:25,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:46:25,601 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:46:25" (1/1) ... [2025-03-17 05:46:25,616 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:46:25" (1/1) ... [2025-03-17 05:46:25,644 INFO L138 Inliner]: procedures = 33, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 462 [2025-03-17 05:46:25,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:25,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:46:25,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:46:25,652 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:46:25,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,693 INFO L175 MemorySlicer]: Split 115 memory accesses to 12 slices as follows [2, 9, 35, 8, 7, 14, 5, 6, 6, 8, 9, 6]. 30 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1]. [2025-03-17 05:46:25,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,710 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,716 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,737 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:46:25,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:46:25,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:46:25,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:46:25,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (1/1) ... [2025-03-17 05:46:25,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:25,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:25,764 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:46:25,767 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:46:25,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:46:25,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:46:25,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:46:25,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:46:25,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:46:25,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:46:25,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:46:25,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:46:25,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:46:25,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:46:25,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:46:25,784 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-17 05:46:25,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-17 05:46:25,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:46:25,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:46:25,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:46:25,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:46:25,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:46:25,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:46:25,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:46:25,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:46:25,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:46:25,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:46:25,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-17 05:46:25,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-17 05:46:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:46:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:46:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:46:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:46:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:46:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:46:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:46:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:46:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-17 05:46:25,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-17 05:46:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-17 05:46:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-17 05:46:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:46:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:46:25,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:46:25,789 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:46:25,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:46:25,791 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:46:25,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-17 05:46:25,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-17 05:46:25,940 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:46:25,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:46:26,365 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2025-03-17 05:46:26,403 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2025-03-17 05:46:26,404 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:46:26,414 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:46:26,415 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:46:26,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:26 BoogieIcfgContainer [2025-03-17 05:46:26,415 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:46:26,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:46:26,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:46:26,421 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:46:26,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:46:25" (1/3) ... [2025-03-17 05:46:26,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18000113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:26, skipping insertion in model container [2025-03-17 05:46:26,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:25" (2/3) ... [2025-03-17 05:46:26,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18000113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:26, skipping insertion in model container [2025-03-17 05:46:26,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:26" (3/3) ... [2025-03-17 05:46:26,423 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-42.i [2025-03-17 05:46:26,432 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:46:26,434 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-42.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:46:26,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:46:26,488 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;@32a7ee9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:46:26,488 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:46:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 80 states have (on average 1.4375) internal successors, (115), 81 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:26,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:26,498 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:26,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:26,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:26,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1574367401, now seen corresponding path program 1 times [2025-03-17 05:46:26,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:26,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385074273] [2025-03-17 05:46:26,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:26,512 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:46:26,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:26,515 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:46:26,517 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:46:26,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:26,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:26,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:26,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:26,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:46:26,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 05:46:26,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:26,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:26,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385074273] [2025-03-17 05:46:26,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385074273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:26,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:26,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:46:26,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474486053] [2025-03-17 05:46:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:26,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:46:26,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:26,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:46:26,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:26,854 INFO L87 Difference]: Start difference. First operand has 94 states, 80 states have (on average 1.4375) internal successors, (115), 81 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:46:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:26,879 INFO L93 Difference]: Finished difference Result 185 states and 283 transitions. [2025-03-17 05:46:26,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:46:26,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 99 [2025-03-17 05:46:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:26,891 INFO L225 Difference]: With dead ends: 185 [2025-03-17 05:46:26,892 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:46:26,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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:46:26,898 INFO L435 NwaCegarLoop]: 131 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, 131 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:46:26,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:46:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 05:46:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:26,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2025-03-17 05:46:26,933 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99 [2025-03-17 05:46:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:26,933 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2025-03-17 05:46:26,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:46:26,934 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2025-03-17 05:46:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:26,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:26,938 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:26,945 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 (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:46:27,139 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:46:27,139 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:27,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:27,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2077695600, now seen corresponding path program 1 times [2025-03-17 05:46:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899809891] [2025-03-17 05:46:27,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:27,142 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:46:27,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:27,144 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:46:27,149 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:46:27,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:27,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:27,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:27,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:27,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:46:27,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:27,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 05:46:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:27,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:27,438 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:27,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899809891] [2025-03-17 05:46:27,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899809891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:27,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:27,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:46:27,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131281968] [2025-03-17 05:46:27,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:27,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:46:27,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:27,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:46:27,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:46:27,440 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:27,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:27,463 INFO L93 Difference]: Finished difference Result 181 states and 258 transitions. [2025-03-17 05:46:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:46:27,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:46:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:27,474 INFO L225 Difference]: With dead ends: 181 [2025-03-17 05:46:27,475 INFO L226 Difference]: Without dead ends: 90 [2025-03-17 05:46:27,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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:46:27,476 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:27,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:27,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-17 05:46:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-17 05:46:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:27,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2025-03-17 05:46:27,484 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 99 [2025-03-17 05:46:27,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:27,485 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2025-03-17 05:46:27,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:27,485 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2025-03-17 05:46:27,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:27,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:27,486 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:27,492 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 (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:46:27,690 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:46:27,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:27,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2080122260, now seen corresponding path program 1 times [2025-03-17 05:46:27,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:27,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [592493719] [2025-03-17 05:46:27,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:27,692 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:46:27,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:27,694 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:46:27,695 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:46:27,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:27,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:27,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:27,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:27,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:46:27,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:28,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-17 05:46:28,243 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 130 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 05:46:28,243 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:28,442 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:46:28,442 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 20 treesize of output 19 [2025-03-17 05:46:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:46:28,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:28,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [592493719] [2025-03-17 05:46:28,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [592493719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:46:28,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:46:28,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-17 05:46:28,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689670508] [2025-03-17 05:46:28,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:46:28,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:46:28,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:28,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:46:28,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:46:28,526 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 05:46:28,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:28,850 INFO L93 Difference]: Finished difference Result 187 states and 260 transitions. [2025-03-17 05:46:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:46:28,853 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) Word has length 99 [2025-03-17 05:46:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:28,854 INFO L225 Difference]: With dead ends: 187 [2025-03-17 05:46:28,854 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 05:46:28,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:46:28,855 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 178 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:28,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 500 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:46:28,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 05:46:28,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2025-03-17 05:46:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2025-03-17 05:46:28,865 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 99 [2025-03-17 05:46:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:28,866 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2025-03-17 05:46:28,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.666666666666667) internal successors, (60), 11 states have internal predecessors, (60), 4 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 2 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 05:46:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2025-03-17 05:46:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:28,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:28,869 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:28,876 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:46:29,069 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:46:29,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:29,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:29,070 INFO L85 PathProgramCache]: Analyzing trace with hash 788902871, now seen corresponding path program 1 times [2025-03-17 05:46:29,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:29,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074328715] [2025-03-17 05:46:29,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:29,071 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:46:29,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:29,073 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:46:29,074 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:46:29,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:29,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:29,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:29,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:29,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:46:29,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:29,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2025-03-17 05:46:29,431 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 17 treesize of output 13 [2025-03-17 05:46:29,508 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 26 treesize of output 22 [2025-03-17 05:46:29,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-17 05:46:29,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2025-03-17 05:46:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:46:29,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:30,206 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-17 05:46:30,207 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 30 treesize of output 29 [2025-03-17 05:46:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:46:30,227 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:30,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074328715] [2025-03-17 05:46:30,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074328715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:46:30,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:46:30,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2025-03-17 05:46:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000752089] [2025-03-17 05:46:30,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:46:30,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 05:46:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:30,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 05:46:30,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:46:30,230 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 23 states, 21 states have (on average 4.238095238095238) internal successors, (89), 23 states have internal predecessors, (89), 5 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 5 states have call successors, (22) [2025-03-17 05:46:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:32,306 INFO L93 Difference]: Finished difference Result 251 states and 334 transitions. [2025-03-17 05:46:32,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-17 05:46:32,307 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.238095238095238) internal successors, (89), 23 states have internal predecessors, (89), 5 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 5 states have call successors, (22) Word has length 99 [2025-03-17 05:46:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:32,310 INFO L225 Difference]: With dead ends: 251 [2025-03-17 05:46:32,310 INFO L226 Difference]: Without dead ends: 158 [2025-03-17 05:46:32,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=472, Invalid=1978, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 05:46:32,312 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 506 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:32,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1209 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:46:32,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-17 05:46:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 100. [2025-03-17 05:46:32,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 85 states have internal predecessors, (112), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:32,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 134 transitions. [2025-03-17 05:46:32,325 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 134 transitions. Word has length 99 [2025-03-17 05:46:32,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:32,326 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 134 transitions. [2025-03-17 05:46:32,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.238095238095238) internal successors, (89), 23 states have internal predecessors, (89), 5 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 3 states have call predecessors, (22), 5 states have call successors, (22) [2025-03-17 05:46:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 134 transitions. [2025-03-17 05:46:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:32,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:32,327 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:32,336 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:46:32,531 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:46:32,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:32,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:32,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1008048488, now seen corresponding path program 1 times [2025-03-17 05:46:32,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:32,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355718783] [2025-03-17 05:46:32,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:32,532 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:46:32,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:32,536 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:46:32,537 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:46:32,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:32,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:32,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:32,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:32,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:46:32,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:32,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 05:46:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:32,745 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:32,745 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:32,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355718783] [2025-03-17 05:46:32,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355718783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:32,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:32,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:46:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176150738] [2025-03-17 05:46:32,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:32,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:46:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:32,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:46:32,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:46:32,746 INFO L87 Difference]: Start difference. First operand 100 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:32,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:32,771 INFO L93 Difference]: Finished difference Result 195 states and 262 transitions. [2025-03-17 05:46:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:46:32,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:46:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:32,773 INFO L225 Difference]: With dead ends: 195 [2025-03-17 05:46:32,773 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 05:46:32,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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:46:32,774 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:32,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 05:46:32,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 05:46:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 128 transitions. [2025-03-17 05:46:32,791 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 128 transitions. Word has length 99 [2025-03-17 05:46:32,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:32,792 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 128 transitions. [2025-03-17 05:46:32,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 128 transitions. [2025-03-17 05:46:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:32,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:32,793 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:32,798 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:46:32,993 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:46:32,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:32,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash -671703717, now seen corresponding path program 1 times [2025-03-17 05:46:32,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:32,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589645614] [2025-03-17 05:46:32,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:32,995 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:46:32,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:32,997 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:46:32,999 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:46:33,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:33,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:33,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:33,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:33,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:46:33,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:33,314 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 21 treesize of output 17 [2025-03-17 05:46:33,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 56 [2025-03-17 05:46:33,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2025-03-17 05:46:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:46:33,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:33,523 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:33,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589645614] [2025-03-17 05:46:33,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589645614] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:33,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:33,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 05:46:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801976701] [2025-03-17 05:46:33,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:33,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:33,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:33,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:46:33,524 INFO L87 Difference]: Start difference. First operand 96 states and 128 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:33,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:33,623 INFO L93 Difference]: Finished difference Result 194 states and 259 transitions. [2025-03-17 05:46:33,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:33,624 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:46:33,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:33,624 INFO L225 Difference]: With dead ends: 194 [2025-03-17 05:46:33,624 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 05:46:33,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:46:33,625 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 61 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:33,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 348 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 05:46:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2025-03-17 05:46:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:33,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 130 transitions. [2025-03-17 05:46:33,641 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 130 transitions. Word has length 99 [2025-03-17 05:46:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:33,642 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 130 transitions. [2025-03-17 05:46:33,642 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 130 transitions. [2025-03-17 05:46:33,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:46:33,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:33,643 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:33,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 05:46:33,844 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:46:33,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:33,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:33,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1826312220, now seen corresponding path program 1 times [2025-03-17 05:46:33,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:33,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355050724] [2025-03-17 05:46:33,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:33,845 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:46:33,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:33,846 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:46:33,847 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:46:33,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:34,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:34,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:34,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:34,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:46:34,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:34,021 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 26 treesize of output 22 [2025-03-17 05:46:34,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-17 05:46:34,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2025-03-17 05:46:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:34,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:34,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:34,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355050724] [2025-03-17 05:46:34,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355050724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:34,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:34,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:46:34,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949883838] [2025-03-17 05:46:34,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:34,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:46:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:34,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:46:34,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:46:34,083 INFO L87 Difference]: Start difference. First operand 98 states and 130 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:34,288 INFO L93 Difference]: Finished difference Result 238 states and 314 transitions. [2025-03-17 05:46:34,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:46:34,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2025-03-17 05:46:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:34,290 INFO L225 Difference]: With dead ends: 238 [2025-03-17 05:46:34,290 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 05:46:34,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:46:34,290 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 110 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:34,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 743 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:46:34,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 05:46:34,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 96. [2025-03-17 05:46:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 126 transitions. [2025-03-17 05:46:34,303 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 126 transitions. Word has length 99 [2025-03-17 05:46:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:34,303 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 126 transitions. [2025-03-17 05:46:34,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 126 transitions. [2025-03-17 05:46:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:46:34,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:34,304 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:34,310 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:46:34,504 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:46:34,505 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:34,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1279448313, now seen corresponding path program 1 times [2025-03-17 05:46:34,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010597828] [2025-03-17 05:46:34,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:34,506 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:46:34,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:34,508 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:46:34,508 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:46:34,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:46:34,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:46:34,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:34,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:34,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 05:46:34,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:34,797 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 21 treesize of output 17 [2025-03-17 05:46:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:46:34,863 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:35,156 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:35,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010597828] [2025-03-17 05:46:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010597828] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:35,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-03-17 05:46:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211954813] [2025-03-17 05:46:35,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:35,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:46:35,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:35,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:46:35,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:46:35,158 INFO L87 Difference]: Start difference. First operand 96 states and 126 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:35,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:35,692 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2025-03-17 05:46:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:46:35,695 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-03-17 05:46:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:35,697 INFO L225 Difference]: With dead ends: 215 [2025-03-17 05:46:35,698 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 05:46:35,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:46:35,699 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 111 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:35,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 991 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:46:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 05:46:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-17 05:46:35,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.271604938271605) internal successors, (103), 81 states have internal predecessors, (103), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:35,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2025-03-17 05:46:35,714 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 101 [2025-03-17 05:46:35,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:35,714 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2025-03-17 05:46:35,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:35,714 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2025-03-17 05:46:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:46:35,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:35,716 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:35,724 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:46:35,916 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:46:35,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:35,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2053904966, now seen corresponding path program 1 times [2025-03-17 05:46:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:35,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283312945] [2025-03-17 05:46:35,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:35,917 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:46:35,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:35,919 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:46:35,920 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:46:36,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:46:36,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:46:36,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:36,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:36,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 05:46:36,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:36,243 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 21 treesize of output 17 [2025-03-17 05:46:36,298 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 26 treesize of output 22 [2025-03-17 05:46:36,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-17 05:46:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:46:36,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:36,635 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:36,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283312945] [2025-03-17 05:46:36,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283312945] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:36,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:36,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2025-03-17 05:46:36,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67829790] [2025-03-17 05:46:36,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:36,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:46:36,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:36,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:46:36,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:46:36,636 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:36,892 INFO L93 Difference]: Finished difference Result 197 states and 255 transitions. [2025-03-17 05:46:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:46:36,892 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-03-17 05:46:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:36,893 INFO L225 Difference]: With dead ends: 197 [2025-03-17 05:46:36,893 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 05:46:36,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:46:36,894 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 3 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:36,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 606 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 05:46:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-17 05:46:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 81 states have internal predecessors, (102), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2025-03-17 05:46:36,909 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 101 [2025-03-17 05:46:36,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:36,910 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2025-03-17 05:46:36,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:36,910 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2025-03-17 05:46:36,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:46:36,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:36,911 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:36,917 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:46:37,115 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:46:37,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:37,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:37,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1730528153, now seen corresponding path program 1 times [2025-03-17 05:46:37,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:37,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [677409325] [2025-03-17 05:46:37,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:37,116 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:46:37,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:37,118 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:46:37,118 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:46:37,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:46:37,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:46:37,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:37,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:37,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:46:37,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:37,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:46:38,076 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:46:38,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:48,913 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:48,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [677409325] [2025-03-17 05:46:48,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [677409325] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:48,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:48,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2025-03-17 05:46:48,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197403832] [2025-03-17 05:46:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:48,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:46:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:48,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:46:48,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=218, Unknown=1, NotChecked=0, Total=272 [2025-03-17 05:46:48,914 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:51,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:51,428 INFO L93 Difference]: Finished difference Result 312 states and 401 transitions. [2025-03-17 05:46:51,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:46:51,430 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 101 [2025-03-17 05:46:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:51,432 INFO L225 Difference]: With dead ends: 312 [2025-03-17 05:46:51,432 INFO L226 Difference]: Without dead ends: 217 [2025-03-17 05:46:51,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=69, Invalid=272, Unknown=1, NotChecked=0, Total=342 [2025-03-17 05:46:51,433 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 140 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:51,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 874 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 05:46:51,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-17 05:46:51,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 105. [2025-03-17 05:46:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 90 states have internal predecessors, (112), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:46:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 134 transitions. [2025-03-17 05:46:51,443 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 134 transitions. Word has length 101 [2025-03-17 05:46:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:51,443 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 134 transitions. [2025-03-17 05:46:51,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 134 transitions. [2025-03-17 05:46:51,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:46:51,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:51,443 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:51,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 05:46:51,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:51,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:51,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1802745031, now seen corresponding path program 1 times [2025-03-17 05:46:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:51,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472166369] [2025-03-17 05:46:51,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:51,645 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:46:51,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:51,647 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:51,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-17 05:46:51,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:46:51,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:46:51,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:51,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:51,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:46:51,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:55,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:46:56,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 37 [2025-03-17 05:46:56,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 49 [2025-03-17 05:46:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:46:56,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:47:16,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472166369] [2025-03-17 05:47:16,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472166369] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:47:16,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1230936699] [2025-03-17 05:47:16,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:16,339 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:47:16,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:47:16,362 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:47:16,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2025-03-17 05:47:16,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:47:16,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:47:16,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:16,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 05:47:16,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:18,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 15 treesize of output 1 [2025-03-17 05:47:24,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:47:26,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 61 [2025-03-17 05:47:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:47:26,688 INFO L312 TraceCheckSpWp]: Computing backward predicates...