./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:44:03,242 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:44:03,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:44:03,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:44:03,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:44:03,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:44:03,307 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:44:03,307 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:44:03,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:44:03,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:44:03,308 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:44:03,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:44:03,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:44:03,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:44:03,308 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:44:03,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:44:03,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:44:03,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:44:03,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:44:03,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:44:03,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:44:03,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:44:03,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:44:03,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:44:03,309 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:44:03,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:44:03,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:44:03,309 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:44:03,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:44:03,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:44:03,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:44:03,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:44:03,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:44:03,310 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:44:03,310 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:44:03,310 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:44:03,310 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:44:03,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:44:03,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:44:03,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:44:03,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:44:03,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:44:03,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:44:03,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:44:03,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:44:03,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:44:03,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:44:03,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:44:03,312 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 [2025-01-09 15:44:03,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:44:03,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:44:03,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:44:03,549 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:44:03,550 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:44:03,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i [2025-01-09 15:44:04,844 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f1df4621/e97b476c87d34fb696b51744a3b4b3e7/FLAGf4665d3f6 [2025-01-09 15:44:05,197 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:44:05,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i [2025-01-09 15:44:05,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f1df4621/e97b476c87d34fb696b51744a3b4b3e7/FLAGf4665d3f6 [2025-01-09 15:44:05,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f1df4621/e97b476c87d34fb696b51744a3b4b3e7 [2025-01-09 15:44:05,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:44:05,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:44:05,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:44:05,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:44:05,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:44:05,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05, skipping insertion in model container [2025-01-09 15:44:05,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:44:05,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i[916,929] [2025-01-09 15:44:05,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:44:05,641 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:44:05,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i[916,929] [2025-01-09 15:44:05,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:44:05,681 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:44:05,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05 WrapperNode [2025-01-09 15:44:05,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:44:05,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:44:05,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:44:05,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:44:05,687 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,717 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2025-01-09 15:44:05,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:44:05,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:44:05,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:44:05,718 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:44:05,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,741 INFO L175 MemorySlicer]: Split 129 memory accesses to 11 slices as follows [2, 13, 6, 3, 10, 8, 64, 6, 3, 7, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 11 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:44:05,741 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,758 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,760 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:44:05,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:44:05,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:44:05,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:44:05,774 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (1/1) ... [2025-01-09 15:44:05,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:44:05,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:44:05,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:44:05,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:44:05,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:44:05,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:44:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:44:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:44:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:44:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:44:05,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:44:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:44:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:44:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-01-09 15:44:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-01-09 15:44:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-01-09 15:44:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-01-09 15:44:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:44:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:44:05,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:44:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:44:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:44:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:44:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:44:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-01-09 15:44:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-01-09 15:44:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-01-09 15:44:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-01-09 15:44:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:44:05,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:44:05,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:44:05,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-01-09 15:44:05,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-01-09 15:44:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-01-09 15:44:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-01-09 15:44:05,823 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:44:05,824 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:44:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:44:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:44:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:44:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:44:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:44:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:44:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:44:05,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:44:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:44:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:44:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:44:05,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:44:05,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:44:05,937 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:44:05,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:44:06,281 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-01-09 15:44:06,282 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:44:06,292 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:44:06,292 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:44:06,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:06 BoogieIcfgContainer [2025-01-09 15:44:06,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:44:06,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:44:06,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:44:06,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:44:06,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:44:05" (1/3) ... [2025-01-09 15:44:06,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6a3c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:06, skipping insertion in model container [2025-01-09 15:44:06,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:05" (2/3) ... [2025-01-09 15:44:06,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a6a3c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:06, skipping insertion in model container [2025-01-09 15:44:06,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:06" (3/3) ... [2025-01-09 15:44:06,299 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-26.i [2025-01-09 15:44:06,311 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:44:06,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-26.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:44:06,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:44:06,358 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;@7ab0f1e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:44:06,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:44:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:06,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:44:06,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:06,367 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:06,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:06,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:06,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1094930748, now seen corresponding path program 1 times [2025-01-09 15:44:06,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:06,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047764948] [2025-01-09 15:44:06,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:06,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:06,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:06,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:06,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 15:44:06,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:06,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047764948] [2025-01-09 15:44:06,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047764948] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:06,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492065772] [2025-01-09 15:44:06,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:06,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:44:06,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:44:06,651 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:44:06,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:44:06,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:06,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:06,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:06,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:06,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:44:06,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 15:44:06,874 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:06,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492065772] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:06,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:44:06,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:44:06,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346865143] [2025-01-09 15:44:06,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:06,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:44:06,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:06,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:44:06,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:44:06,897 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:44:06,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:06,912 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2025-01-09 15:44:06,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:44:06,913 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-01-09 15:44:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:06,917 INFO L225 Difference]: With dead ends: 178 [2025-01-09 15:44:06,917 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 15:44:06,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-01-09 15:44:06,921 INFO L435 NwaCegarLoop]: 127 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, 127 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-01-09 15:44:06,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 15:44:06,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 15:44:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:06,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-01-09 15:44:06,945 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2025-01-09 15:44:06,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:06,945 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-01-09 15:44:06,945 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:44:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-01-09 15:44:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:44:06,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:06,947 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:06,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:44:07,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:44:07,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:07,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:07,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1248382006, now seen corresponding path program 1 times [2025-01-09 15:44:07,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:07,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611707699] [2025-01-09 15:44:07,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:07,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:07,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:07,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:07,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:07,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:44:07,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:07,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611707699] [2025-01-09 15:44:07,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611707699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:07,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:07,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:44:07,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484685806] [2025-01-09 15:44:07,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:07,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:44:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:07,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:44:07,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:44:07,357 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:44:07,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:07,380 INFO L93 Difference]: Finished difference Result 177 states and 254 transitions. [2025-01-09 15:44:07,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:44:07,381 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-01-09 15:44:07,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:07,381 INFO L225 Difference]: With dead ends: 177 [2025-01-09 15:44:07,382 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:44:07,382 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-01-09 15:44:07,382 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:07,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:44:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 15:44:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-01-09 15:44:07,390 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2025-01-09 15:44:07,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:07,391 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-01-09 15:44:07,391 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), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:44:07,391 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-01-09 15:44:07,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:44:07,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:07,393 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:07,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:44:07,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:07,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:07,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1665778612, now seen corresponding path program 1 times [2025-01-09 15:44:07,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:07,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678606225] [2025-01-09 15:44:07,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:07,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:07,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:07,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:07,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:07,574 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:44:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:07,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678606225] [2025-01-09 15:44:07,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678606225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:07,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:07,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:44:07,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202377294] [2025-01-09 15:44:07,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:07,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:44:07,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:07,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:44:07,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:44:07,576 INFO L87 Difference]: Start difference. First operand 91 states and 129 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:44:07,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:07,607 INFO L93 Difference]: Finished difference Result 182 states and 259 transitions. [2025-01-09 15:44:07,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:44:07,608 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-01-09 15:44:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:07,608 INFO L225 Difference]: With dead ends: 182 [2025-01-09 15:44:07,608 INFO L226 Difference]: Without dead ends: 94 [2025-01-09 15:44:07,609 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-01-09 15:44:07,609 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:07,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 363 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-01-09 15:44:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-01-09 15:44:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2025-01-09 15:44:07,620 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 89 [2025-01-09 15:44:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:07,621 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2025-01-09 15:44:07,622 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:44:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2025-01-09 15:44:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:44:07,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:07,623 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:07,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:44:07,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:07,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:07,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1667625654, now seen corresponding path program 1 times [2025-01-09 15:44:07,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:07,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282654483] [2025-01-09 15:44:07,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:07,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:07,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:07,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:07,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:07,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:44:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:08,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282654483] [2025-01-09 15:44:08,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282654483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:08,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:08,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:44:08,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290593425] [2025-01-09 15:44:08,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:08,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:44:08,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:08,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:44:08,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:44:08,243 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 15:44:08,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:08,345 INFO L93 Difference]: Finished difference Result 183 states and 259 transitions. [2025-01-09 15:44:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:44:08,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 89 [2025-01-09 15:44:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:08,349 INFO L225 Difference]: With dead ends: 183 [2025-01-09 15:44:08,349 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:44:08,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:44:08,350 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 107 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:08,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 335 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:44:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 15:44:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-01-09 15:44:08,362 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 89 [2025-01-09 15:44:08,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:08,362 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-01-09 15:44:08,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 15:44:08,362 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-01-09 15:44:08,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:44:08,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:08,367 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:08,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:44:08,367 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:08,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:08,367 INFO L85 PathProgramCache]: Analyzing trace with hash 849977204, now seen corresponding path program 1 times [2025-01-09 15:44:08,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:08,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455833306] [2025-01-09 15:44:08,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:08,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:08,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:08,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:08,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:08,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:44:08,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:44:08,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455833306] [2025-01-09 15:44:08,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455833306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:08,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:08,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:44:08,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106939786] [2025-01-09 15:44:08,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:08,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:44:08,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:44:08,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:44:08,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:44:08,917 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 15:44:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:09,084 INFO L93 Difference]: Finished difference Result 183 states and 257 transitions. [2025-01-09 15:44:09,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:44:09,085 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 89 [2025-01-09 15:44:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:09,086 INFO L225 Difference]: With dead ends: 183 [2025-01-09 15:44:09,087 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:44:09,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:44:09,090 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 106 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:09,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 373 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:44:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 15:44:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:09,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2025-01-09 15:44:09,100 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 89 [2025-01-09 15:44:09,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:09,101 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2025-01-09 15:44:09,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2025-01-09 15:44:09,101 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2025-01-09 15:44:09,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:44:09,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:09,102 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:09,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:44:09,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:09,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:09,105 INFO L85 PathProgramCache]: Analyzing trace with hash -161140046, now seen corresponding path program 1 times [2025-01-09 15:44:09,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:44:09,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87052563] [2025-01-09 15:44:09,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:09,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:44:09,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:09,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:09,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:09,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:44:09,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [252469351] [2025-01-09 15:44:09,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:09,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:44:09,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:44:09,209 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:44:09,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:44:09,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:09,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:09,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:09,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:44:09,442 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:44:09,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:09,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:09,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:09,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:44:09,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:44:09,586 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:44:09,586 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:44:09,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:44:09,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:44:09,791 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 15:44:09,916 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:44:09,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:44:09 BoogieIcfgContainer [2025-01-09 15:44:09,919 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:44:09,920 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:44:09,920 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:44:09,920 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:44:09,920 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:06" (3/4) ... [2025-01-09 15:44:09,922 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:44:09,924 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:44:09,924 INFO L158 Benchmark]: Toolchain (without parser) took 4437.11ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 111.7MB in the beginning and 130.7MB in the end (delta: -19.0MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2025-01-09 15:44:09,925 INFO L158 Benchmark]: CDTParser took 4.29ms. Allocated memory is still 201.3MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:44:09,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.94ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:44:09,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.32ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 93.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:44:09,926 INFO L158 Benchmark]: Boogie Preprocessor took 54.68ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 88.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:44:09,926 INFO L158 Benchmark]: RCFGBuilder took 520.04ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 49.8MB in the end (delta: 38.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:44:09,926 INFO L158 Benchmark]: TraceAbstraction took 3625.07ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 49.3MB in the beginning and 130.7MB in the end (delta: -81.4MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2025-01-09 15:44:09,927 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 176.2MB. Free memory was 130.7MB in the beginning and 130.7MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:44:09,928 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 4.29ms. Allocated memory is still 201.3MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 193.94ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.1MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.32ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 93.1MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 54.68ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 88.7MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 520.04ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 49.8MB in the end (delta: 38.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3625.07ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 49.3MB in the beginning and 130.7MB in the end (delta: -81.4MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 176.2MB. Free memory was 130.7MB in the beginning and 130.7MB in the end (delta: 33.1kB). 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 81, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 51, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryArithmeticFLOAToperation at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L22] signed short int var_1_1 = -1; [L23] signed short int* var_1_1_Pointer = &(var_1_1); [L24] signed short int var_1_4 = 1; [L24] signed short int var_1_4 = 1; [L25] signed short int* var_1_4_Pointer = &(var_1_4); [L26] float var_1_12 = 1.125; [L26] float var_1_12 = 1.125; [L27] float* var_1_12_Pointer = &(var_1_12); [L28] float var_1_13 = 199.5; [L28] float var_1_13 = 199.5; [L29] float* var_1_13_Pointer = &(var_1_13); [L30] float var_1_14 = 100000000000000.3; [L30] float var_1_14 = 100000000000000.3; [L31] float* var_1_14_Pointer = &(var_1_14); [L32] unsigned char var_1_15 = 64; [L32] unsigned char var_1_15 = 64; [L33] unsigned char* var_1_15_Pointer = &(var_1_15); [L34] unsigned char var_1_16 = 2; [L34] unsigned char var_1_16 = 2; [L35] unsigned char* var_1_16_Pointer = &(var_1_16); [L36] unsigned long int var_1_17 = 50; [L36] unsigned long int var_1_17 = 50; [L37] unsigned long int* var_1_17_Pointer = &(var_1_17); [L38] signed long int var_1_19 = -32; [L38] signed long int var_1_19 = -32; [L39] signed long int* var_1_19_Pointer = &(var_1_19); [L40] float var_1_20 = 8.75; [L40] float var_1_20 = 8.75; [L41] float* var_1_20_Pointer = &(var_1_20); [L42] unsigned char last_1_var_1_15 = 64; VAL [isInitial=0, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L85] isInitial = 1 [L86] FCALL initially() [L88] CALL updateLastVariables() [L78] EXPR \read(var_1_15) [L78] last_1_var_1_15 = var_1_15 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_short() [L63] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L63] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L63] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L64] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L64] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L64] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L65] var_1_13 = __VERIFIER_nondet_float() [L66] EXPR \read(var_1_13) [L66] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F [L66] EXPR \read(var_1_13) [L66] EXPR var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] EXPR (var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L66] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L67] var_1_14 = __VERIFIER_nondet_float() [L68] EXPR \read(var_1_14) [L68] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F [L68] EXPR \read(var_1_14) [L68] EXPR var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] EXPR (var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L68] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L69] var_1_16 = __VERIFIER_nondet_uchar() [L70] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L70] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L70] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L71] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L71] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L71] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L72] var_1_19 = __VERIFIER_nondet_long() [L73] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L73] CALL assume_abort_if_not(var_1_19 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L73] RET assume_abort_if_not(var_1_19 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L74] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L74] CALL assume_abort_if_not(var_1_19 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L74] RET assume_abort_if_not(var_1_19 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L75] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L75] CALL assume_abort_if_not(var_1_19 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L75] RET assume_abort_if_not(var_1_19 != 0) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L89] RET updateVariables() [L90] CALL step() [L46] EXPR \read(*var_1_13_Pointer) [L46] EXPR \read(*var_1_14_Pointer) [L46] (*(var_1_12_Pointer)) = ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))) [L47] EXPR \read(*var_1_4_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L47] COND TRUE (- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4)))) [L48] EXPR \read(*var_1_16_Pointer) [L48] (*(var_1_15_Pointer)) = (*(var_1_16_Pointer)) [L50] EXPR \read(*var_1_13_Pointer) [L50] (*(var_1_20_Pointer)) = (*(var_1_13_Pointer)) [L51] EXPR \read(*var_1_20_Pointer) [L51] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L51] COND TRUE (*(var_1_20_Pointer)) > (*(var_1_20_Pointer)) [L52] EXPR \read(*var_1_15_Pointer) [L52] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L52] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L52] EXPR \read(*var_1_15_Pointer) [L52] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L52] (*(var_1_1_Pointer)) = (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))) [L56] EXPR \read(*var_1_15_Pointer) [L56] EXPR \read(*var_1_15_Pointer) [L56] EXPR \read(*var_1_1_Pointer) [L56] signed long int stepLocal_0 = (*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer))); [L57] EXPR \read(*var_1_15_Pointer) [L57] EXPR \read(*var_1_1_Pointer) [L57] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L57] COND FALSE !(stepLocal_0 != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) [L90] RET step() [L91] CALL, EXPR property() [L81] EXPR \read(*var_1_20_Pointer) [L81] EXPR \read(*var_1_20_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))))))) [L81] EXPR \read(*var_1_1_Pointer) [L81] EXPR \read(*var_1_15_Pointer) [L81] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) [L81] EXPR \read(*var_1_15_Pointer) [L81] EXPR (((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))))) [L81] EXPR \read(*var_1_12_Pointer) [L81] EXPR \read(*var_1_13_Pointer) [L81] EXPR \read(*var_1_14_Pointer) [L81] EXPR (((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR (((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_13_Pointer)))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81] EXPR ((((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_13_Pointer)))) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L81-L82] return ((((((*(var_1_20_Pointer)) > (*(var_1_20_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed short int) (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed short int) ((((((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) < (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))) ? (((*(var_1_15_Pointer)) - (((((*(var_1_15_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer))))))) : (((*(var_1_15_Pointer)) + (((((*(var_1_15_Pointer))) < ((*(var_1_15_Pointer)))) ? ((*(var_1_15_Pointer))) : ((*(var_1_15_Pointer)))))))))))) && ((*(var_1_12_Pointer)) == ((float) ((0.85f - (*(var_1_13_Pointer))) + (*(var_1_14_Pointer)))))) && (((- last_1_var_1_15) >= ((*(var_1_4_Pointer)) / ((((-4) < 0 ) ? -(-4) : (-4))))) ? ((*(var_1_15_Pointer)) == ((unsigned char) (*(var_1_16_Pointer)))) : 1)) && ((((*(var_1_15_Pointer)) + ((*(var_1_15_Pointer)) + (*(var_1_1_Pointer)))) != ((*(var_1_15_Pointer)) * ((*(var_1_1_Pointer)) / (*(var_1_19_Pointer))))) ? ((*(var_1_17_Pointer)) == ((unsigned long int) (((((10u) < (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer))))) ? (10u) : (((*(var_1_1_Pointer)) + (*(var_1_15_Pointer)))))) + (*(var_1_15_Pointer))))) : 1)) && ((*(var_1_20_Pointer)) == ((float) (*(var_1_13_Pointer)))) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=64, var_1_12={6:0}, var_1_12_Pointer={6:0}, var_1_13={7:0}, var_1_13_Pointer={7:0}, var_1_14={8:0}, var_1_14_Pointer={8:0}, var_1_15={9:0}, var_1_15_Pointer={9:0}, var_1_16={10:0}, var_1_16_Pointer={10:0}, var_1_17={11:0}, var_1_17_Pointer={11:0}, var_1_19={12:0}, var_1_19_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={13:0}, var_1_20_Pointer={13:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 214 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 214 mSDsluCounter, 1562 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 948 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 195 IncrementalHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 614 mSDtfsCounter, 195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 5 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 712 NumberOfCodeBlocks, 712 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 528 ConstructedInterpolants, 0 QuantifiedInterpolants, 857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 430 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 848/864 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-01-09 15:44:09,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:44:12,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:44:12,262 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:44:12,267 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:44:12,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:44:12,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:44:12,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:44:12,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:44:12,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:44:12,296 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:44:12,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:44:12,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:44:12,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:44:12,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:44:12,296 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:44:12,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:44:12,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:44:12,296 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:44:12,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:44:12,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:44:12,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:44:12,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:44:12,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:44:12,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:44:12,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:44:12,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:44:12,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:44:12,298 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:44:12,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:44:12,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:44:12,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:44:12,299 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:44:12,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:44:12,299 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:44:12,299 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:44:12,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:44:12,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:44:12,299 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:44:12,299 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:44:12,299 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4eafc4bfcba9d31705115bfcf6cea5cccc44f2a222fea4448f4711e0f4e7a043 [2025-01-09 15:44:12,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:44:12,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:44:12,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:44:12,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:44:12,517 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:44:12,519 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i [2025-01-09 15:44:13,764 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96d2e07ae/3aaf3d0e2843472a837ddf2ea5cbdf0b/FLAGf3754129b [2025-01-09 15:44:14,035 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:44:14,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i [2025-01-09 15:44:14,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96d2e07ae/3aaf3d0e2843472a837ddf2ea5cbdf0b/FLAGf3754129b [2025-01-09 15:44:14,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/96d2e07ae/3aaf3d0e2843472a837ddf2ea5cbdf0b [2025-01-09 15:44:14,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:44:14,060 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:44:14,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:44:14,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:44:14,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:44:14,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1647ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14, skipping insertion in model container [2025-01-09 15:44:14,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,083 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:44:14,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i[916,929] [2025-01-09 15:44:14,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:44:14,237 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:44:14,244 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-26.i[916,929] [2025-01-09 15:44:14,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:44:14,286 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:44:14,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14 WrapperNode [2025-01-09 15:44:14,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:44:14,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:44:14,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:44:14,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:44:14,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,326 INFO L138 Inliner]: procedures = 36, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2025-01-09 15:44:14,327 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:44:14,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:44:14,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:44:14,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:44:14,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,338 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,352 INFO L175 MemorySlicer]: Split 129 memory accesses to 11 slices as follows [2, 13, 6, 3, 10, 8, 64, 6, 3, 7, 7]. 50 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 11 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:44:14,352 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:44:14,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:44:14,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:44:14,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:44:14,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (1/1) ... [2025-01-09 15:44:14,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:44:14,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:44:14,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:44:14,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:44:14,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:44:14,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:44:14,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:44:14,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:44:14,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-01-09 15:44:14,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:44:14,436 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:44:14,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-01-09 15:44:14,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-01-09 15:44:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:44:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:44:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:44:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:44:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:44:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:44:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-09 15:44:14,437 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-01-09 15:44:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-01-09 15:44:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-01-09 15:44:14,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-01-09 15:44:14,618 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:44:14,620 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:44:15,791 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-01-09 15:44:15,791 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:44:15,798 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:44:15,798 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:44:15,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:15 BoogieIcfgContainer [2025-01-09 15:44:15,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:44:15,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:44:15,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:44:15,803 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:44:15,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:44:14" (1/3) ... [2025-01-09 15:44:15,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29152178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:15, skipping insertion in model container [2025-01-09 15:44:15,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:44:14" (2/3) ... [2025-01-09 15:44:15,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29152178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:44:15, skipping insertion in model container [2025-01-09 15:44:15,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:44:15" (3/3) ... [2025-01-09 15:44:15,805 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-26.i [2025-01-09 15:44:15,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:44:15,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-26.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:44:15,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:44:15,860 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;@7e267b91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:44:15,860 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:44:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:44:15,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:15,869 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:15,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1094930748, now seen corresponding path program 1 times [2025-01-09 15:44:15,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:15,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871738842] [2025-01-09 15:44:15,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:15,890 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-01-09 15:44:15,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:15,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 15:44:15,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:16,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:16,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:16,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:16,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:16,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:44:16,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 15:44:16,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:16,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:16,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871738842] [2025-01-09 15:44:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871738842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:16,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:44:16,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169269247] [2025-01-09 15:44:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:16,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:44:16,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:16,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:44:16,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:44:16,315 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:44:16,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:16,334 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2025-01-09 15:44:16,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:44:16,335 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-01-09 15:44:16,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:16,339 INFO L225 Difference]: With dead ends: 178 [2025-01-09 15:44:16,339 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 15:44:16,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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-01-09 15:44:16,345 INFO L435 NwaCegarLoop]: 127 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, 127 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-01-09 15:44:16,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 15:44:16,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-01-09 15:44:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-01-09 15:44:16,383 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2025-01-09 15:44:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:16,384 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-01-09 15:44:16,384 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, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:44:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-01-09 15:44:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:44:16,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:16,386 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:16,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 15:44:16,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 15:44:16,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:16,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:16,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1248382006, now seen corresponding path program 1 times [2025-01-09 15:44:16,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:16,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092853485] [2025-01-09 15:44:16,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:16,594 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-01-09 15:44:16,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:16,596 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 15:44:16,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:16,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:16,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:16,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:16,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:16,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:44:16,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:16,941 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 15:44:16,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:16,941 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:16,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092853485] [2025-01-09 15:44:16,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092853485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:16,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:16,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:44:16,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661301053] [2025-01-09 15:44:16,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:16,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:44:16,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:16,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:44:16,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:44:16,943 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:44:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:17,303 INFO L93 Difference]: Finished difference Result 177 states and 254 transitions. [2025-01-09 15:44:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:44:17,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-01-09 15:44:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:17,310 INFO L225 Difference]: With dead ends: 177 [2025-01-09 15:44:17,310 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:44:17,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 86 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-01-09 15:44:17,311 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:17,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:44:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:44:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 15:44:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-01-09 15:44:17,322 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2025-01-09 15:44:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:17,323 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-01-09 15:44:17,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:44:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-01-09 15:44:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:44:17,325 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:17,325 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:17,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 15:44:17,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 15:44:17,526 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:17,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:17,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1665778612, now seen corresponding path program 1 times [2025-01-09 15:44:17,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:17,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223861904] [2025-01-09 15:44:17,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:17,527 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-01-09 15:44:17,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:17,529 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 15:44:17,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:17,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:17,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:17,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:17,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:17,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:44:17,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:17,938 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:44:17,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:17,938 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:17,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223861904] [2025-01-09 15:44:17,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223861904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:17,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:17,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:44:17,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034860439] [2025-01-09 15:44:17,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:17,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:44:17,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:17,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:44:17,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:17,939 INFO L87 Difference]: Start difference. First operand 91 states and 129 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:44:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:18,007 INFO L93 Difference]: Finished difference Result 184 states and 262 transitions. [2025-01-09 15:44:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:44:18,008 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-01-09 15:44:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:18,009 INFO L225 Difference]: With dead ends: 184 [2025-01-09 15:44:18,010 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 15:44:18,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:44:18,011 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:18,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:44:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 15:44:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 15:44:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 133 transitions. [2025-01-09 15:44:18,016 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 133 transitions. Word has length 89 [2025-01-09 15:44:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:18,017 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 133 transitions. [2025-01-09 15:44:18,017 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:44:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 133 transitions. [2025-01-09 15:44:18,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-01-09 15:44:18,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:18,018 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:18,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:18,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-01-09 15:44:18,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:18,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:18,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1667625654, now seen corresponding path program 1 times [2025-01-09 15:44:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:18,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316674938] [2025-01-09 15:44:18,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:18,223 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-01-09 15:44:18,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:18,225 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-01-09 15:44:18,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:18,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 15:44:18,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 15:44:18,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:18,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:18,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:44:18,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:18,688 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 77 treesize of output 41 [2025-01-09 15:44:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-01-09 15:44:18,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:18,724 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:18,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316674938] [2025-01-09 15:44:18,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316674938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:18,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:18,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:44:18,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141315932] [2025-01-09 15:44:18,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:18,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:44:18,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:18,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:44:18,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:44:18,725 INFO L87 Difference]: Start difference. First operand 95 states and 133 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:44:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:19,393 INFO L93 Difference]: Finished difference Result 188 states and 264 transitions. [2025-01-09 15:44:19,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:44:19,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-01-09 15:44:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:19,395 INFO L225 Difference]: With dead ends: 188 [2025-01-09 15:44:19,395 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 15:44:19,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:44:19,396 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 113 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:19,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 433 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:44:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 15:44:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 15:44:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2025-01-09 15:44:19,401 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 89 [2025-01-09 15:44:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:19,401 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2025-01-09 15:44:19,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 15:44:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2025-01-09 15:44:19,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 15:44:19,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:19,404 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:19,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:19,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-01-09 15:44:19,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:19,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:19,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1876305008, now seen corresponding path program 1 times [2025-01-09 15:44:19,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:19,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1064423623] [2025-01-09 15:44:19,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:19,605 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-01-09 15:44:19,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:19,609 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-01-09 15:44:19,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:19,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 15:44:19,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 15:44:19,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:19,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:19,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:44:19,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:20,691 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 74 treesize of output 38 [2025-01-09 15:44:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 15:44:20,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:20,890 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:44:20,890 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:20,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1064423623] [2025-01-09 15:44:20,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1064423623] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:20,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:44:20,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2025-01-09 15:44:20,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200212766] [2025-01-09 15:44:20,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:20,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:44:20,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:20,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:44:20,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:44:20,892 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:44:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:21,274 INFO L93 Difference]: Finished difference Result 185 states and 258 transitions. [2025-01-09 15:44:21,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:44:21,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 91 [2025-01-09 15:44:21,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:21,275 INFO L225 Difference]: With dead ends: 185 [2025-01-09 15:44:21,275 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:44:21,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:44:21,276 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:21,277 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.4s Time] [2025-01-09 15:44:21,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:44:21,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 15:44:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3414634146341464) internal successors, (110), 82 states have internal predecessors, (110), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 128 transitions. [2025-01-09 15:44:21,289 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 128 transitions. Word has length 91 [2025-01-09 15:44:21,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:21,289 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 128 transitions. [2025-01-09 15:44:21,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:44:21,290 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 128 transitions. [2025-01-09 15:44:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 15:44:21,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:21,290 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:21,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:21,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-01-09 15:44:21,491 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:21,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:21,492 INFO L85 PathProgramCache]: Analyzing trace with hash -95731268, now seen corresponding path program 1 times [2025-01-09 15:44:21,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:21,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143773896] [2025-01-09 15:44:21,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:21,493 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-01-09 15:44:21,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:21,496 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-01-09 15:44:21,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:21,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 15:44:21,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 15:44:21,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:21,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:21,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 15:44:21,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:22,720 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-01-09 15:44:22,727 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 86 treesize of output 50 [2025-01-09 15:44:22,912 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 70 treesize of output 34 [2025-01-09 15:44:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 15:44:22,983 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:44:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:44:23,090 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:23,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143773896] [2025-01-09 15:44:23,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143773896] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:44:23,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:44:23,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2025-01-09 15:44:23,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557673054] [2025-01-09 15:44:23,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:23,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:44:23,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:23,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:44:23,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:44:23,092 INFO L87 Difference]: Start difference. First operand 93 states and 128 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:44:23,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:23,107 INFO L93 Difference]: Finished difference Result 181 states and 250 transitions. [2025-01-09 15:44:23,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:44:23,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 96 [2025-01-09 15:44:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:23,111 INFO L225 Difference]: With dead ends: 181 [2025-01-09 15:44:23,111 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:44:23,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:44:23,112 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 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-01-09 15:44:23,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:44:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:44:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 15:44:23,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:23,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2025-01-09 15:44:23,121 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 96 [2025-01-09 15:44:23,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:23,121 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2025-01-09 15:44:23,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:44:23,121 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2025-01-09 15:44:23,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 15:44:23,122 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:23,122 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:23,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-01-09 15:44:23,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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-01-09 15:44:23,327 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:23,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash 607750271, now seen corresponding path program 1 times [2025-01-09 15:44:23,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:23,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914595059] [2025-01-09 15:44:23,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:23,328 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-01-09 15:44:23,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:23,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-01-09 15:44:23,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:23,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 15:44:23,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 15:44:23,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:44:23,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:44:23,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:44:23,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:44:23,856 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-01-09 15:44:23,882 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:44:23,882 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:44:23,882 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:44:23,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914595059] [2025-01-09 15:44:23,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914595059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:44:23,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:44:23,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:44:23,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936765729] [2025-01-09 15:44:23,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:44:23,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:44:23,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:44:23,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:44:23,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:44:23,883 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:44:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:44:24,221 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2025-01-09 15:44:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:44:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 15:44:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:44:24,225 INFO L225 Difference]: With dead ends: 179 [2025-01-09 15:44:24,225 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:44:24,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-01-09 15:44:24,225 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:44:24,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 228 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:44:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:44:24,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 15:44:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:44:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2025-01-09 15:44:24,229 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 101 [2025-01-09 15:44:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:44:24,230 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2025-01-09 15:44:24,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:44:24,230 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2025-01-09 15:44:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 15:44:24,230 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:44:24,230 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:44:24,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:24,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/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-01-09 15:44:24,435 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:44:24,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:44:24,435 INFO L85 PathProgramCache]: Analyzing trace with hash 630382525, now seen corresponding path program 1 times [2025-01-09 15:44:24,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:44:24,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752626601] [2025-01-09 15:44:24,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:44:24,436 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-01-09 15:44:24,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:44:24,439 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/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-01-09 15:44:24,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:44:24,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 15:45:21,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 15:45:21,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:45:21,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:45:21,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:45:21,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:45:21,987 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-01-09 15:45:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:45:22,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:45:22,002 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:45:22,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752626601] [2025-01-09 15:45:22,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752626601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:45:22,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:45:22,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:45:22,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291275369] [2025-01-09 15:45:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:45:22,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:45:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:45:22,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:45:22,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:45:22,003 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:45:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:45:22,516 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2025-01-09 15:45:22,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:45:22,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 15:45:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:45:22,518 INFO L225 Difference]: With dead ends: 179 [2025-01-09 15:45:22,519 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:45:22,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-01-09 15:45:22,520 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:45:22,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:45:22,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:45:22,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 15:45:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:45:22,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2025-01-09 15:45:22,527 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 101 [2025-01-09 15:45:22,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:45:22,527 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2025-01-09 15:45:22,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:45:22,528 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2025-01-09 15:45:22,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 15:45:22,528 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:45:22,528 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:45:22,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:45:22,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/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-01-09 15:45:22,729 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:45:22,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:45:22,729 INFO L85 PathProgramCache]: Analyzing trace with hash 120909435, now seen corresponding path program 1 times [2025-01-09 15:45:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:45:22,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686791093] [2025-01-09 15:45:22,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:45:22,730 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-01-09 15:45:22,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:45:22,733 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/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-01-09 15:45:22,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:45:22,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 15:45:44,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 15:45:44,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:45:44,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:45:44,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:45:44,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:45:44,928 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-01-09 15:45:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 15:45:44,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:45:44,939 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:45:44,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686791093] [2025-01-09 15:45:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686791093] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:45:44,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:45:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:45:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091469959] [2025-01-09 15:45:44,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:45:44,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:45:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:45:44,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:45:44,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:45:44,941 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:45:45,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:45:45,541 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2025-01-09 15:45:45,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:45:45,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2025-01-09 15:45:45,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:45:45,542 INFO L225 Difference]: With dead ends: 179 [2025-01-09 15:45:45,542 INFO L226 Difference]: Without dead ends: 91 [2025-01-09 15:45:45,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-01-09 15:45:45,543 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:45:45,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:45:45,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-09 15:45:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-01-09 15:45:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 15:45:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 121 transitions. [2025-01-09 15:45:45,546 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 121 transitions. Word has length 101 [2025-01-09 15:45:45,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:45:45,546 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 121 transitions. [2025-01-09 15:45:45,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 15:45:45,546 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 121 transitions. [2025-01-09 15:45:45,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 15:45:45,547 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:45:45,547 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:45:45,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-01-09 15:45:45,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/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-01-09 15:45:45,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:45:45,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:45:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash 182949049, now seen corresponding path program 1 times [2025-01-09 15:45:45,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:45:45,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116289278] [2025-01-09 15:45:45,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:45:45,752 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-01-09 15:45:45,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:45:45,754 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/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-01-09 15:45:45,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:45:45,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.