./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-48.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-48.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 e8bf74309a8b022d6e645ae6ad00767c20272f1d55203a857771147b8948c784 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:47:00,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:47:00,108 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:47:00,112 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:47:00,113 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:47:00,129 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:47:00,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:47:00,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:47:00,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:47:00,131 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:47:00,131 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:47:00,131 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:47:00,132 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:47:00,132 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:47:00,132 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:47:00,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:47:00,133 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:47:00,134 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:47:00,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:47:00,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:47:00,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:47:00,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:47:00,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:47:00,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:47:00,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:47:00,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:47:00,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:47:00,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:47:00,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:47:00,135 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:47:00,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:47:00,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:47:00,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:47:00,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:47:00,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:47:00,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:47:00,135 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:47:00,136 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 -> e8bf74309a8b022d6e645ae6ad00767c20272f1d55203a857771147b8948c784 [2025-01-09 15:47:00,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:47:00,380 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:47:00,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:47:00,384 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:47:00,384 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:47:00,385 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-48.i [2025-01-09 15:47:01,553 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d135086b1/8d8cd35ae75a46a693fe0e82cc73cc4a/FLAGb1e3381b1 [2025-01-09 15:47:01,854 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:47:01,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-48.i [2025-01-09 15:47:01,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d135086b1/8d8cd35ae75a46a693fe0e82cc73cc4a/FLAGb1e3381b1 [2025-01-09 15:47:02,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d135086b1/8d8cd35ae75a46a693fe0e82cc73cc4a [2025-01-09 15:47:02,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:47:02,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:47:02,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:47:02,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:47:02,148 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:47:02,149 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e45d32c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02, skipping insertion in model container [2025-01-09 15:47:02,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:47:02,357 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-48.i[916,929] [2025-01-09 15:47:02,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:47:02,470 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:47:02,486 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-48.i[916,929] [2025-01-09 15:47:02,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:47:02,561 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:47:02,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02 WrapperNode [2025-01-09 15:47:02,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:47:02,563 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:47:02,563 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:47:02,563 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:47:02,569 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:47:02" (1/1) ... [2025-01-09 15:47:02,581 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:47:02" (1/1) ... [2025-01-09 15:47:02,617 INFO L138 Inliner]: procedures = 29, calls = 194, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 547 [2025-01-09 15:47:02,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:47:02,618 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:47:02,620 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:47:02,620 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:47:02,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,635 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,664 INFO L175 MemorySlicer]: Split 143 memory accesses to 20 slices as follows [2, 7, 8, 10, 8, 8, 12, 6, 8, 10, 6, 10, 8, 7, 8, 6, 8, 3, 5, 3]. 8 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 23 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:47:02,666 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,666 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:47:02,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:47:02,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:47:02,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:47:02,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (1/1) ... [2025-01-09 15:47:02,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:47:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:47:02,726 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:47:02,728 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:47:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:47:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:47:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:47:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:47:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:47:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:47:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:47:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:47:02,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 15:47:02,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-01-09 15:47:02,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#16 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#17 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#18 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#19 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:47:02,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#16 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#17 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#18 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#19 [2025-01-09 15:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 15:47:02,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#16 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#17 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#18 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#19 [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:47:02,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:47:02,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 15:47:02,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:47:02,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:47:02,897 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:47:02,898 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:47:03,209 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 15:47:03,210 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:47:03,217 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:47:03,217 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:47:03,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:03 BoogieIcfgContainer [2025-01-09 15:47:03,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:47:03,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:47:03,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:47:03,222 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:47:03,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:47:02" (1/3) ... [2025-01-09 15:47:03,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bcbd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:03, skipping insertion in model container [2025-01-09 15:47:03,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:02" (2/3) ... [2025-01-09 15:47:03,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73bcbd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:03, skipping insertion in model container [2025-01-09 15:47:03,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:03" (3/3) ... [2025-01-09 15:47:03,223 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-48.i [2025-01-09 15:47:03,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:47:03,234 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-48.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:47:03,267 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:47:03,275 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;@1d2ec700, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:47:03,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:47:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:03,285 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:03,286 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:03,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:03,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:03,290 INFO L85 PathProgramCache]: Analyzing trace with hash -541151885, now seen corresponding path program 1 times [2025-01-09 15:47:03,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:47:03,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332991461] [2025-01-09 15:47:03,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:47:03,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:03,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:03,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:03,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 15:47:03,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:47:03,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332991461] [2025-01-09 15:47:03,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332991461] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:47:03,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069514886] [2025-01-09 15:47:03,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:03,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:47:03,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:47:03,627 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:47:03,628 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:47:03,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:03,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:03,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:03,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:03,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:47:03,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 15:47:03,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:03,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069514886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:03,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:47:03,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:47:03,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559494195] [2025-01-09 15:47:03,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:03,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:47:03,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:47:03,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:47:03,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:47:03,923 INFO L87 Difference]: Start difference. First operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:03,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:03,940 INFO L93 Difference]: Finished difference Result 228 states and 358 transitions. [2025-01-09 15:47:03,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:47:03,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-01-09 15:47:03,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:03,945 INFO L225 Difference]: With dead ends: 228 [2025-01-09 15:47:03,945 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 15:47:03,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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:47:03,948 INFO L435 NwaCegarLoop]: 164 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, 164 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:47:03,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 15:47:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 15:47:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-01-09 15:47:03,972 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2025-01-09 15:47:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:03,972 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-01-09 15:47:03,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-01-09 15:47:03,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:03,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:03,976 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:03,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 15:47:04,180 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:47:04,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:04,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:04,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1577113617, now seen corresponding path program 1 times [2025-01-09 15:47:04,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:47:04,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256017005] [2025-01-09 15:47:04,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:04,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:47:04,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:04,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:04,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:04,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:04,559 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:04,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:47:04,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256017005] [2025-01-09 15:47:04,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256017005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:04,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:04,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:47:04,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971572602] [2025-01-09 15:47:04,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:04,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:47:04,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:47:04,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:47:04,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:47:04,564 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:04,613 INFO L93 Difference]: Finished difference Result 228 states and 329 transitions. [2025-01-09 15:47:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:47:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-01-09 15:47:04,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:04,615 INFO L225 Difference]: With dead ends: 228 [2025-01-09 15:47:04,615 INFO L226 Difference]: Without dead ends: 117 [2025-01-09 15:47:04,615 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:47:04,616 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:04,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 472 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-01-09 15:47:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2025-01-09 15:47:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 states have internal predecessors, (124), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 166 transitions. [2025-01-09 15:47:04,635 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 166 transitions. Word has length 168 [2025-01-09 15:47:04,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:04,636 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 166 transitions. [2025-01-09 15:47:04,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:04,636 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 166 transitions. [2025-01-09 15:47:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:04,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:04,640 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:04,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:47:04,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:04,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2037795309, now seen corresponding path program 1 times [2025-01-09 15:47:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:47:04,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148220928] [2025-01-09 15:47:04,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:04,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:47:04,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:04,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:04,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:04,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:04,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:47:04,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148220928] [2025-01-09 15:47:04,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148220928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:04,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:04,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:47:04,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993441313] [2025-01-09 15:47:04,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:04,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:47:04,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:47:04,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:47:04,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:47:04,850 INFO L87 Difference]: Start difference. First operand 116 states and 166 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:04,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:04,892 INFO L93 Difference]: Finished difference Result 232 states and 333 transitions. [2025-01-09 15:47:04,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:47:04,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-01-09 15:47:04,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:04,896 INFO L225 Difference]: With dead ends: 232 [2025-01-09 15:47:04,897 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 15:47:04,898 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:47:04,898 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:04,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 473 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:04,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 15:47:04,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2025-01-09 15:47:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3263157894736841) internal successors, (126), 95 states have internal predecessors, (126), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 168 transitions. [2025-01-09 15:47:04,914 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 168 transitions. Word has length 168 [2025-01-09 15:47:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:04,914 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 168 transitions. [2025-01-09 15:47:04,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:04,915 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 168 transitions. [2025-01-09 15:47:04,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:04,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:04,916 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:04,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:47:04,920 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:04,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:04,921 INFO L85 PathProgramCache]: Analyzing trace with hash -262787947, now seen corresponding path program 1 times [2025-01-09 15:47:04,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:47:04,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051643959] [2025-01-09 15:47:04,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:04,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:47:04,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:04,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:04,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:04,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:05,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:47:05,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051643959] [2025-01-09 15:47:05,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051643959] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:05,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:05,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:47:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364340703] [2025-01-09 15:47:05,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:05,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:47:05,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:47:05,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:47:05,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:47:05,127 INFO L87 Difference]: Start difference. First operand 118 states and 168 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:05,155 INFO L93 Difference]: Finished difference Result 236 states and 337 transitions. [2025-01-09 15:47:05,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:47:05,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-01-09 15:47:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:05,156 INFO L225 Difference]: With dead ends: 236 [2025-01-09 15:47:05,156 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 15:47:05,157 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:47:05,157 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:05,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 475 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 15:47:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2025-01-09 15:47:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 97 states have internal predecessors, (128), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 170 transitions. [2025-01-09 15:47:05,163 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 170 transitions. Word has length 168 [2025-01-09 15:47:05,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:05,164 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 170 transitions. [2025-01-09 15:47:05,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 170 transitions. [2025-01-09 15:47:05,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:05,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:05,165 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:05,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:47:05,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:05,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:05,166 INFO L85 PathProgramCache]: Analyzing trace with hash -260940905, now seen corresponding path program 1 times [2025-01-09 15:47:05,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:47:05,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201002034] [2025-01-09 15:47:05,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:05,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:47:05,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:05,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:05,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:05,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:06,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:47:06,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201002034] [2025-01-09 15:47:06,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201002034] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:06,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:06,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:47:06,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977124995] [2025-01-09 15:47:06,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:06,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:47:06,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:47:06,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:47:06,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:47:06,144 INFO L87 Difference]: Start difference. First operand 120 states and 170 transitions. Second operand has 9 states, 7 states have (on average 9.428571428571429) internal successors, (66), 9 states have internal predecessors, (66), 7 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21) [2025-01-09 15:47:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:06,319 INFO L93 Difference]: Finished difference Result 237 states and 337 transitions. [2025-01-09 15:47:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:47:06,319 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.428571428571429) internal successors, (66), 9 states have internal predecessors, (66), 7 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21) Word has length 168 [2025-01-09 15:47:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:06,320 INFO L225 Difference]: With dead ends: 237 [2025-01-09 15:47:06,321 INFO L226 Difference]: Without dead ends: 120 [2025-01-09 15:47:06,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:47:06,321 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 297 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:06,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 518 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:47:06,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-01-09 15:47:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-01-09 15:47:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 97 states have (on average 1.309278350515464) internal successors, (127), 97 states have internal predecessors, (127), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2025-01-09 15:47:06,329 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 168 [2025-01-09 15:47:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:06,329 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2025-01-09 15:47:06,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.428571428571429) internal successors, (66), 9 states have internal predecessors, (66), 7 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 7 states have call successors, (21) [2025-01-09 15:47:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2025-01-09 15:47:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:06,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:06,331 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:06,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:47:06,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:06,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1949884647, now seen corresponding path program 1 times [2025-01-09 15:47:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:47:06,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599163216] [2025-01-09 15:47:06,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:47:06,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:06,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:06,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:06,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:47:06,407 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:47:06,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:06,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:06,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:06,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:47:06,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:47:06,596 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:47:06,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:47:06,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:47:06,601 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 15:47:06,838 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:47:06,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:47:06 BoogieIcfgContainer [2025-01-09 15:47:06,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:47:06,841 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:47:06,841 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:47:06,841 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:47:06,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:03" (3/4) ... [2025-01-09 15:47:06,844 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:47:06,844 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:47:06,845 INFO L158 Benchmark]: Toolchain (without parser) took 4706.81ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 124.0MB in the beginning and 147.3MB in the end (delta: -23.4MB). Peak memory consumption was 177.2MB. Max. memory is 16.1GB. [2025-01-09 15:47:06,845 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:47:06,845 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.66ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 108.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:47:06,847 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.44ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 104.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:47:06,847 INFO L158 Benchmark]: Boogie Preprocessor took 77.71ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 98.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:47:06,847 INFO L158 Benchmark]: RCFGBuilder took 520.82ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 52.8MB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 15:47:06,847 INFO L158 Benchmark]: TraceAbstraction took 3622.12ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 52.0MB in the beginning and 147.4MB in the end (delta: -95.4MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. [2025-01-09 15:47:06,847 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 369.1MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:47:06,848 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 117.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.66ms. Allocated memory is still 167.8MB. Free memory was 123.1MB in the beginning and 108.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.44ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 104.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.71ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 98.8MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 520.82ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 52.8MB in the end (delta: 46.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3622.12ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 52.0MB in the beginning and 147.4MB in the end (delta: -95.4MB). Peak memory consumption was 110.1MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 369.1MB. Free memory was 147.4MB in the beginning and 147.3MB in the end (delta: 75.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 96, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 64, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 32.8; [L22] float var_1_1 = 32.8; [L23] float* var_1_1_Pointer = &(var_1_1); [L24] float var_1_2 = 255.675; [L24] float var_1_2 = 255.675; [L25] float* var_1_2_Pointer = &(var_1_2); [L26] float var_1_3 = 5.5; [L26] float var_1_3 = 5.5; [L27] float* var_1_3_Pointer = &(var_1_3); [L28] float var_1_4 = 128.75; [L28] float var_1_4 = 128.75; [L29] float* var_1_4_Pointer = &(var_1_4); [L30] float var_1_5 = 4.5; [L30] float var_1_5 = 4.5; [L31] float* var_1_5_Pointer = &(var_1_5); [L32] float var_1_6 = 9.25; [L32] float var_1_6 = 9.25; [L33] float* var_1_6_Pointer = &(var_1_6); [L34] unsigned char var_1_7 = 5; [L34] unsigned char var_1_7 = 5; [L35] unsigned char* var_1_7_Pointer = &(var_1_7); [L36] unsigned char var_1_11 = 200; [L36] unsigned char var_1_11 = 200; [L37] unsigned char* var_1_11_Pointer = &(var_1_11); [L38] unsigned char var_1_12 = 8; [L38] unsigned char var_1_12 = 8; [L39] unsigned char* var_1_12_Pointer = &(var_1_12); [L40] unsigned char var_1_13 = 4; [L40] unsigned char var_1_13 = 4; [L41] unsigned char* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 100; [L42] unsigned char var_1_14 = 100; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned char var_1_15 = 64; [L44] unsigned char var_1_15 = 64; [L45] unsigned char* var_1_15_Pointer = &(var_1_15); [L46] unsigned char var_1_16 = 1; [L46] unsigned char var_1_16 = 1; [L47] unsigned char* var_1_16_Pointer = &(var_1_16); [L48] unsigned char var_1_17 = 200; [L48] unsigned char var_1_17 = 200; [L49] unsigned char* var_1_17_Pointer = &(var_1_17); [L50] unsigned char var_1_18 = 2; [L50] unsigned char var_1_18 = 2; [L51] unsigned char* var_1_18_Pointer = &(var_1_18); [L52] unsigned char var_1_19 = 0; [L52] unsigned char var_1_19 = 0; [L53] unsigned char* var_1_19_Pointer = &(var_1_19); [L54] unsigned long int var_1_20 = 1; [L54] unsigned long int var_1_20 = 1; [L55] unsigned long int* var_1_20_Pointer = &(var_1_20); [L56] signed long int var_1_21 = 64; [L56] signed long int var_1_21 = 64; [L57] signed long int* var_1_21_Pointer = &(var_1_21); [L58] unsigned char var_1_22 = 100; [L58] unsigned char var_1_22 = 100; [L59] unsigned char* var_1_22_Pointer = &(var_1_22); [L60] unsigned char last_1_var_1_7 = 5; VAL [isInitial=0, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L134] isInitial = 1 [L135] FCALL initially() [L137] CALL updateLastVariables() [L127] EXPR \read(var_1_7) [L127] last_1_var_1_7 = var_1_7 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L91] var_1_2 = __VERIFIER_nondet_float() [L92] EXPR \read(var_1_2) [L92] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L92] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F [L92] EXPR \read(var_1_2) [L92] EXPR var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L92] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L92] EXPR (var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L92] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L92] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L93] var_1_3 = __VERIFIER_nondet_float() [L94] EXPR \read(var_1_3) [L94] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L94] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F [L94] EXPR \read(var_1_3) [L94] EXPR var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L94] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L94] EXPR (var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L94] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L94] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L95] var_1_4 = __VERIFIER_nondet_float() [L96] EXPR \read(var_1_4) [L96] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L96] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F [L96] EXPR \read(var_1_4) [L96] EXPR var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L96] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L96] EXPR (var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L96] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L96] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L97] var_1_5 = __VERIFIER_nondet_float() [L98] EXPR \read(var_1_5) [L98] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L98] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F [L98] EXPR \read(var_1_5) [L98] EXPR var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L98] EXPR (var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L98] EXPR (var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L98] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L98] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L99] var_1_6 = __VERIFIER_nondet_float() [L100] EXPR \read(var_1_6) [L100] EXPR var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L100] EXPR var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F [L100] EXPR \read(var_1_6) [L100] EXPR var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L100] EXPR (var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L100] EXPR (var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L100] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L100] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L102] CALL assume_abort_if_not(var_1_11 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L102] RET assume_abort_if_not(var_1_11 >= 190) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L103] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L104] var_1_12 = __VERIFIER_nondet_uchar() [L105] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L105] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L105] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L106] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L107] var_1_13 = __VERIFIER_nondet_uchar() [L108] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L108] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L108] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L109] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L109] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L109] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L110] var_1_14 = __VERIFIER_nondet_uchar() [L111] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L111] CALL assume_abort_if_not(var_1_14 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L111] RET assume_abort_if_not(var_1_14 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L112] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L112] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L112] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L113] var_1_15 = __VERIFIER_nondet_uchar() [L114] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L114] CALL assume_abort_if_not(var_1_15 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L114] RET assume_abort_if_not(var_1_15 >= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L115] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L115] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L115] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L116] var_1_17 = __VERIFIER_nondet_uchar() [L117] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L117] CALL assume_abort_if_not(var_1_17 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L117] RET assume_abort_if_not(var_1_17 >= 191) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L118] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L118] CALL assume_abort_if_not(var_1_17 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L118] RET assume_abort_if_not(var_1_17 <= 255) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L120] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L120] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L121] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L121] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L121] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L123] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L123] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L124] EXPR \read(var_1_19) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L124] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L124] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L138] RET updateVariables() [L139] CALL step() [L64] EXPR \read(*var_1_2_Pointer) [L64] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L64] COND FALSE !((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) [L71] EXPR \read(*var_1_6_Pointer) [L71] (*(var_1_1_Pointer)) = (*(var_1_6_Pointer)) [L73] EXPR \read(*var_1_14_Pointer) [L73] (*(var_1_20_Pointer)) = (*(var_1_14_Pointer)) [L74] EXPR \read(*var_1_17_Pointer) [L74] (*(var_1_21_Pointer)) = (*(var_1_17_Pointer)) [L75] (*(var_1_22_Pointer)) = 4 [L76] EXPR \read(*var_1_21_Pointer) [L76] signed long int stepLocal_0 = (*(var_1_21_Pointer)); [L77] EXPR \read(*var_1_17_Pointer) [L77] EXPR \read(*var_1_12_Pointer) [L77] EXPR \read(*var_1_18_Pointer) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L77] COND FALSE !((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > stepLocal_0) [L80] EXPR \read(*var_1_19_Pointer) [L80] (*(var_1_16_Pointer)) = (*(var_1_19_Pointer)) [L82] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L82] COND FALSE !((*(var_1_16_Pointer))) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR \read(*var_1_2_Pointer) [L130] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR ((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) [L130] EXPR \read(*var_1_1_Pointer) [L130] EXPR \read(*var_1_6_Pointer) [L130] EXPR ((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR ((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer))))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR ((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer))))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR ((((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_21_Pointer)) == ((signed long int) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR ((((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_21_Pointer)) == ((signed long int) (*(var_1_17_Pointer)))) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_21_Pointer)) == ((signed long int) (*(var_1_17_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned char) 4)) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130] EXPR (((((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_21_Pointer)) == ((signed long int) (*(var_1_17_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned char) 4)) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L130-L131] return (((((((*(var_1_2_Pointer)) <= (*(var_1_3_Pointer))) ? (((*(var_1_3_Pointer)) < (((*(var_1_4_Pointer)) - (*(var_1_5_Pointer))) + 1.395f)) ? ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer)))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) : ((*(var_1_1_Pointer)) == ((float) (*(var_1_6_Pointer))))) && ((*(var_1_16_Pointer)) ? ((last_1_var_1_7 != last_1_var_1_7) ? ((*(var_1_7_Pointer)) == ((unsigned char) (((*(var_1_11_Pointer)) - (*(var_1_12_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_7_Pointer)) == ((unsigned char) ((*(var_1_11_Pointer)) - ((((((*(var_1_14_Pointer))) > ((*(var_1_15_Pointer)))) ? ((*(var_1_14_Pointer))) : ((*(var_1_15_Pointer))))) - (*(var_1_12_Pointer))))))) : 1)) && (((((*(var_1_17_Pointer)) - (*(var_1_12_Pointer))) - (8 + (*(var_1_18_Pointer)))) > (*(var_1_21_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (! (*(var_1_19_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_19_Pointer)))))) && ((*(var_1_20_Pointer)) == ((unsigned long int) (*(var_1_14_Pointer))))) && ((*(var_1_21_Pointer)) == ((signed long int) (*(var_1_17_Pointer))))) && ((*(var_1_22_Pointer)) == ((unsigned char) 4)) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_7=5, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_15={15:0}, var_1_15_Pointer={15:0}, var_1_16={16:0}, var_1_16_Pointer={16:0}, var_1_17={17:0}, var_1_17_Pointer={17:0}, var_1_18={18:0}, var_1_18_Pointer={18:0}, var_1_19={19:0}, var_1_19_Pointer={19:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={20:0}, var_1_20_Pointer={20:0}, var_1_21={21:0}, var_1_21_Pointer={21:0}, var_1_22={22:0}, var_1_22_Pointer={22:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_4={7:0}, var_1_4_Pointer={7:0}, var_1_5={8:0}, var_1_5_Pointer={8:0}, var_1_6={9:0}, var_1_6_Pointer={9:0}, var_1_7={10:0}, var_1_7_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 117 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 300 mSDsluCounter, 2102 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1303 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 799 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=4, InterpolantAutomatonStates: 20, 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, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1176 NumberOfCodeBlocks, 1176 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 1620 SizeOfPredicates, 0 NumberOfNonLiveVariables, 762 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 5000/5040 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:47:06,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally 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-48.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 e8bf74309a8b022d6e645ae6ad00767c20272f1d55203a857771147b8948c784 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:47:08,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:47:09,052 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:47:09,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:47:09,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:47:09,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:47:09,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:47:09,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:47:09,076 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:47:09,076 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:47:09,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:47:09,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:47:09,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:47:09,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:47:09,076 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:47:09,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:47:09,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:47:09,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:47:09,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:47:09,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:47:09,077 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:47:09,077 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:47:09,077 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:47:09,077 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:47:09,077 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:47:09,077 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:47:09,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:47:09,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:47:09,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:47:09,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:47:09,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:47:09,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:47:09,078 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:47:09,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:47:09,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:47:09,078 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:47:09,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:47:09,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:47:09,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:47:09,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:47:09,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:47:09,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:47:09,079 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:47:09,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:47:09,079 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:47:09,079 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:47:09,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:47:09,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:47:09,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:47:09,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:47:09,080 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 -> e8bf74309a8b022d6e645ae6ad00767c20272f1d55203a857771147b8948c784 [2025-01-09 15:47:09,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:47:09,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:47:09,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:47:09,339 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:47:09,339 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:47:09,339 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-48.i [2025-01-09 15:47:10,628 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/574e0bebe/25825af45f4145e3b0c9f5616d31c8a3/FLAGbf8e688b0 [2025-01-09 15:47:10,841 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:47:10,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-48.i [2025-01-09 15:47:10,849 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/574e0bebe/25825af45f4145e3b0c9f5616d31c8a3/FLAGbf8e688b0 [2025-01-09 15:47:11,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/574e0bebe/25825af45f4145e3b0c9f5616d31c8a3 [2025-01-09 15:47:11,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:47:11,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:47:11,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:47:11,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:47:11,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:47:11,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb27fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11, skipping insertion in model container [2025-01-09 15:47:11,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:47:11,328 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-48.i[916,929] [2025-01-09 15:47:11,386 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:47:11,399 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:47:11,408 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-48.i[916,929] [2025-01-09 15:47:11,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:47:11,462 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:47:11,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11 WrapperNode [2025-01-09 15:47:11,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:47:11,464 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:47:11,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:47:11,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:47:11,470 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:47:11" (1/1) ... [2025-01-09 15:47:11,485 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:47:11" (1/1) ... [2025-01-09 15:47:11,512 INFO L138 Inliner]: procedures = 33, calls = 194, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 547 [2025-01-09 15:47:11,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:47:11,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:47:11,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:47:11,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:47:11,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,529 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,557 INFO L175 MemorySlicer]: Split 143 memory accesses to 20 slices as follows [2, 7, 8, 10, 8, 8, 12, 6, 8, 10, 6, 10, 8, 7, 8, 6, 8, 3, 5, 3]. 8 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 23 writes are split as follows [0, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1]. [2025-01-09 15:47:11,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,584 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,619 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:47:11,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:47:11,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:47:11,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:47:11,625 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (1/1) ... [2025-01-09 15:47:11,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:47:11,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:47:11,659 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:47:11,661 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:47:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:47:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:47:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:47:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:47:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:47:11,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#16 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#17 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#18 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#19 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-01-09 15:47:11,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#16 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#17 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#18 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#19 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2025-01-09 15:47:11,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#16 [2025-01-09 15:47:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#17 [2025-01-09 15:47:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#18 [2025-01-09 15:47:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#19 [2025-01-09 15:47:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:47:11,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:47:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:47:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:47:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:47:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:47:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:47:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-01-09 15:47:11,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-01-09 15:47:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-01-09 15:47:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-01-09 15:47:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-01-09 15:47:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-01-09 15:47:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-01-09 15:47:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-01-09 15:47:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2025-01-09 15:47:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#16 [2025-01-09 15:47:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#17 [2025-01-09 15:47:11,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#18 [2025-01-09 15:47:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#19 [2025-01-09 15:47:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:47:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:47:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:47:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:47:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:47:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:47:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-09 15:47:11,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#16 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#17 [2025-01-09 15:47:11,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#18 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#19 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#16 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#17 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#18 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#19 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-01-09 15:47:11,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#16 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#17 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#18 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#19 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:47:11,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:47:11,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-01-09 15:47:11,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-01-09 15:47:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-01-09 15:47:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#16 [2025-01-09 15:47:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#17 [2025-01-09 15:47:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#18 [2025-01-09 15:47:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#19 [2025-01-09 15:47:11,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-01-09 15:47:11,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2025-01-09 15:47:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#16 [2025-01-09 15:47:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#17 [2025-01-09 15:47:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#18 [2025-01-09 15:47:11,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#19 [2025-01-09 15:47:11,941 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:47:11,943 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:47:13,415 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-01-09 15:47:13,415 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:47:13,424 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:47:13,425 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:47:13,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:13 BoogieIcfgContainer [2025-01-09 15:47:13,425 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:47:13,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:47:13,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:47:13,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:47:13,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:47:11" (1/3) ... [2025-01-09 15:47:13,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7033eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:13, skipping insertion in model container [2025-01-09 15:47:13,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:47:11" (2/3) ... [2025-01-09 15:47:13,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7033eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:47:13, skipping insertion in model container [2025-01-09 15:47:13,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:47:13" (3/3) ... [2025-01-09 15:47:13,431 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-48.i [2025-01-09 15:47:13,440 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:47:13,441 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-48.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:47:13,490 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:47:13,505 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;@38e8f8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:47:13,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:47:13,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:13,522 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:13,523 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:13,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash -541151885, now seen corresponding path program 1 times [2025-01-09 15:47:13,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905372422] [2025-01-09 15:47:13,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:13,540 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:47:13,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:13,548 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:47:13,549 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:47:13,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:13,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:13,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:13,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:13,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:47:13,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 724 trivial. 0 not checked. [2025-01-09 15:47:13,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:13,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:13,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905372422] [2025-01-09 15:47:13,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905372422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:13,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:13,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:47:13,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592152638] [2025-01-09 15:47:13,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:13,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:47:13,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:14,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:47:14,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:47:14,017 INFO L87 Difference]: Start difference. First operand has 117 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:14,041 INFO L93 Difference]: Finished difference Result 228 states and 358 transitions. [2025-01-09 15:47:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:47:14,042 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-01-09 15:47:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:14,050 INFO L225 Difference]: With dead ends: 228 [2025-01-09 15:47:14,051 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 15:47:14,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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:47:14,054 INFO L435 NwaCegarLoop]: 164 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, 164 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:47:14,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:14,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 15:47:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 15:47:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 164 transitions. [2025-01-09 15:47:14,083 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 164 transitions. Word has length 168 [2025-01-09 15:47:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:14,084 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 164 transitions. [2025-01-09 15:47:14,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:14,084 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 164 transitions. [2025-01-09 15:47:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:14,086 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:14,086 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:14,103 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 (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:47:14,286 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:47:14,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:14,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:14,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1577113617, now seen corresponding path program 1 times [2025-01-09 15:47:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311975576] [2025-01-09 15:47:14,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:14,289 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:47:14,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:14,293 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:47:14,294 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:47:14,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:14,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:14,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:14,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:14,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:47:14,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:15,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2025-01-09 15:47:15,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:47:15,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2025-01-09 15:47:15,477 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 40 treesize of output 28 [2025-01-09 15:47:15,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2025-01-09 15:47:15,514 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:47:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:47:15,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:47:15,576 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 40 treesize of output 36 [2025-01-09 15:47:15,580 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 15:47:15,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:47:15,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2025-01-09 15:47:15,746 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:47:15,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-01-09 15:47:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 15:47:16,048 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:16,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311975576] [2025-01-09 15:47:16,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311975576] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:47:16,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:47:16,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-01-09 15:47:16,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661642457] [2025-01-09 15:47:16,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:16,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:47:16,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:16,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:47:16,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:47:16,050 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:16,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:16,617 INFO L93 Difference]: Finished difference Result 348 states and 496 transitions. [2025-01-09 15:47:16,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:47:16,617 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-01-09 15:47:16,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:16,619 INFO L225 Difference]: With dead ends: 348 [2025-01-09 15:47:16,619 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 15:47:16,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:47:16,620 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 1009 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:16,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 527 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:47:16,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 15:47:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 120. [2025-01-09 15:47:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:16,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2025-01-09 15:47:16,639 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 168 [2025-01-09 15:47:16,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:16,639 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2025-01-09 15:47:16,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:16,639 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2025-01-09 15:47:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:16,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:16,641 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:16,650 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:47:16,845 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:47:16,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:16,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash -111830125, now seen corresponding path program 1 times [2025-01-09 15:47:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:16,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917764374] [2025-01-09 15:47:16,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:16,846 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:47:16,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:16,848 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:47:16,850 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:47:16,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:17,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:17,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:17,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:17,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:47:17,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:17,209 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:17,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:17,209 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917764374] [2025-01-09 15:47:17,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917764374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:17,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:17,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:47:17,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785527915] [2025-01-09 15:47:17,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:17,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:47:17,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:17,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:47:17,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:47:17,210 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:17,255 INFO L93 Difference]: Finished difference Result 242 states and 342 transitions. [2025-01-09 15:47:17,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:47:17,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-01-09 15:47:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:17,257 INFO L225 Difference]: With dead ends: 242 [2025-01-09 15:47:17,257 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 15:47:17,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 164 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:47:17,258 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:17,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 620 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 15:47:17,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-01-09 15:47:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2025-01-09 15:47:17,267 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 168 [2025-01-09 15:47:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:17,267 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2025-01-09 15:47:17,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2025-01-09 15:47:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:17,268 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:17,268 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:17,278 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:47:17,469 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:47:17,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:17,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:17,470 INFO L85 PathProgramCache]: Analyzing trace with hash 568228245, now seen corresponding path program 1 times [2025-01-09 15:47:17,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:17,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212018894] [2025-01-09 15:47:17,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:17,470 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:47:17,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:17,472 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:47:17,473 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:47:17,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:17,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:17,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:17,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:17,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:47:17,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:17,811 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:17,812 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:17,812 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:17,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212018894] [2025-01-09 15:47:17,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212018894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:17,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:17,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:47:17,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658002371] [2025-01-09 15:47:17,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:17,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:47:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:17,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:47:17,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:47:17,813 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:17,857 INFO L93 Difference]: Finished difference Result 248 states and 347 transitions. [2025-01-09 15:47:17,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:47:17,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-01-09 15:47:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:17,859 INFO L225 Difference]: With dead ends: 248 [2025-01-09 15:47:17,859 INFO L226 Difference]: Without dead ends: 127 [2025-01-09 15:47:17,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:47:17,860 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 1 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:17,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 765 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:17,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-01-09 15:47:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2025-01-09 15:47:17,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 175 transitions. [2025-01-09 15:47:17,868 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 175 transitions. Word has length 168 [2025-01-09 15:47:17,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:17,869 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 175 transitions. [2025-01-09 15:47:17,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 175 transitions. [2025-01-09 15:47:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:17,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:17,870 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:17,879 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:47:18,070 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:47:18,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:18,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:18,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1951731689, now seen corresponding path program 1 times [2025-01-09 15:47:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:18,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345538338] [2025-01-09 15:47:18,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:18,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:47:18,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:18,074 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:47:18,075 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:47:18,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:18,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:18,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:18,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:18,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:47:18,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:18,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:18,421 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:18,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345538338] [2025-01-09 15:47:18,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345538338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:18,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:18,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:47:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488848525] [2025-01-09 15:47:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:18,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:47:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:18,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:47:18,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:47:18,422 INFO L87 Difference]: Start difference. First operand 126 states and 175 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:18,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:18,483 INFO L93 Difference]: Finished difference Result 252 states and 351 transitions. [2025-01-09 15:47:18,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:47:18,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 168 [2025-01-09 15:47:18,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:18,484 INFO L225 Difference]: With dead ends: 252 [2025-01-09 15:47:18,484 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 15:47:18,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:47:18,485 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:18,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 911 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 15:47:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-01-09 15:47:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 177 transitions. [2025-01-09 15:47:18,493 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 177 transitions. Word has length 168 [2025-01-09 15:47:18,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:18,493 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 177 transitions. [2025-01-09 15:47:18,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:18,494 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2025-01-09 15:47:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 15:47:18,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:18,495 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:18,507 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:47:18,695 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:47:18,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:18,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:18,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1949884647, now seen corresponding path program 1 times [2025-01-09 15:47:18,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:18,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307394464] [2025-01-09 15:47:18,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:18,696 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:47:18,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:18,699 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:47:18,700 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:47:18,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 15:47:19,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 15:47:19,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:19,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:19,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:47:19,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:19,105 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:47:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-01-09 15:47:19,130 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:19,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:19,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307394464] [2025-01-09 15:47:19,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307394464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:19,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:19,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:47:19,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51145801] [2025-01-09 15:47:19,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:19,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:47:19,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:19,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:47:19,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:47:19,132 INFO L87 Difference]: Start difference. First operand 128 states and 177 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:20,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:20,273 INFO L93 Difference]: Finished difference Result 254 states and 352 transitions. [2025-01-09 15:47:20,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:47:20,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 168 [2025-01-09 15:47:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:20,279 INFO L225 Difference]: With dead ends: 254 [2025-01-09 15:47:20,279 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 15:47:20,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:47:20,280 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 144 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:20,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 502 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 15:47:20,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 15:47:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-01-09 15:47:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2884615384615385) internal successors, (134), 104 states have internal predecessors, (134), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 176 transitions. [2025-01-09 15:47:20,287 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 176 transitions. Word has length 168 [2025-01-09 15:47:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:20,288 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 176 transitions. [2025-01-09 15:47:20,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 176 transitions. [2025-01-09 15:47:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-01-09 15:47:20,289 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:20,289 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:20,300 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 (7)] Ended with exit code 0 [2025-01-09 15:47:20,489 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:47:20,490 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:20,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash 163808639, now seen corresponding path program 1 times [2025-01-09 15:47:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:20,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782987349] [2025-01-09 15:47:20,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:20,490 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:47:20,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:20,493 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:47:20,494 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:47:20,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 15:47:20,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 15:47:20,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:20,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:20,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 15:47:20,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:20,924 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:47:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 216 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2025-01-09 15:47:20,940 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:20,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:20,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782987349] [2025-01-09 15:47:20,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782987349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:20,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:20,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:47:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388641150] [2025-01-09 15:47:20,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:20,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:47:20,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:20,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:47:20,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:47:20,941 INFO L87 Difference]: Start difference. First operand 128 states and 176 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:22,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:22,169 INFO L93 Difference]: Finished difference Result 254 states and 350 transitions. [2025-01-09 15:47:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:47:22,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 170 [2025-01-09 15:47:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:22,181 INFO L225 Difference]: With dead ends: 254 [2025-01-09 15:47:22,181 INFO L226 Difference]: Without dead ends: 129 [2025-01-09 15:47:22,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:47:22,182 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 134 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:22,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 501 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 15:47:22,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-01-09 15:47:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2025-01-09 15:47:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 104 states have (on average 1.2788461538461537) internal successors, (133), 104 states have internal predecessors, (133), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 15:47:22,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 175 transitions. [2025-01-09 15:47:22,199 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 175 transitions. Word has length 170 [2025-01-09 15:47:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:22,199 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 175 transitions. [2025-01-09 15:47:22,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 175 transitions. [2025-01-09 15:47:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 15:47:22,200 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:22,201 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:22,219 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:47:22,401 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:47:22,402 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:22,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:22,402 INFO L85 PathProgramCache]: Analyzing trace with hash -161317927, now seen corresponding path program 1 times [2025-01-09 15:47:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:22,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597465926] [2025-01-09 15:47:22,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:22,403 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:47:22,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:22,405 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:47:22,406 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:47:22,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 15:47:22,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 15:47:22,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:22,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:22,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:47:22,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:23,611 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:47:23,682 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 128 treesize of output 92 [2025-01-09 15:47:23,684 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 140 treesize of output 80 [2025-01-09 15:47:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-01-09 15:47:23,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:47:23,854 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:23,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597465926] [2025-01-09 15:47:23,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597465926] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:47:23,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1354299996] [2025-01-09 15:47:23,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:23,855 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:47:23,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:47:23,860 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:47:23,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-01-09 15:47:24,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 15:47:25,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 15:47:25,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:25,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:25,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 15:47:25,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:25,710 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:47:26,852 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:47:26,980 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 128 treesize of output 92 [2025-01-09 15:47:26,982 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 140 treesize of output 80 [2025-01-09 15:47:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-01-09 15:47:27,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:47:27,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1354299996] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:47:27,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:47:27,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-01-09 15:47:27,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255648373] [2025-01-09 15:47:27,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:47:27,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:47:27,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:27,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:47:27,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:47:27,076 INFO L87 Difference]: Start difference. First operand 128 states and 175 transitions. Second operand has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 15:47:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:30,274 INFO L93 Difference]: Finished difference Result 381 states and 520 transitions. [2025-01-09 15:47:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:47:30,275 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 172 [2025-01-09 15:47:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:30,277 INFO L225 Difference]: With dead ends: 381 [2025-01-09 15:47:30,277 INFO L226 Difference]: Without dead ends: 256 [2025-01-09 15:47:30,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 371 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=521, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:47:30,278 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 455 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:30,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1045 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-09 15:47:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-01-09 15:47:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2025-01-09 15:47:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 205 states have (on average 1.273170731707317) internal successors, (261), 206 states have internal predecessors, (261), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:47:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 345 transitions. [2025-01-09 15:47:30,301 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 345 transitions. Word has length 172 [2025-01-09 15:47:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:30,301 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 345 transitions. [2025-01-09 15:47:30,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 15 states have internal predecessors, (132), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 15:47:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 345 transitions. [2025-01-09 15:47:30,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 15:47:30,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:30,302 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:30,312 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:47:30,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-01-09 15:47:30,707 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,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 15:47:30,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:30,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash -595823525, now seen corresponding path program 1 times [2025-01-09 15:47:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:30,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947158395] [2025-01-09 15:47:30,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:30,709 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:47:30,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:30,710 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:47:30,712 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:47:30,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 15:47:30,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 15:47:30,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:30,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:31,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:47:31,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-01-09 15:47:31,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:31,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947158395] [2025-01-09 15:47:31,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947158395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:31,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:31,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:47:31,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346756204] [2025-01-09 15:47:31,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:31,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:47:31,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:31,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:47:31,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:47:31,023 INFO L87 Difference]: Start difference. First operand 253 states and 345 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:31,060 INFO L93 Difference]: Finished difference Result 503 states and 687 transitions. [2025-01-09 15:47:31,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:47:31,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 172 [2025-01-09 15:47:31,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:31,064 INFO L225 Difference]: With dead ends: 503 [2025-01-09 15:47:31,064 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 15:47:31,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 169 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:47:31,066 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:31,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 472 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 15:47:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-01-09 15:47:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 205 states have (on average 1.2682926829268293) internal successors, (260), 206 states have internal predecessors, (260), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:47:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 344 transitions. [2025-01-09 15:47:31,086 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 344 transitions. Word has length 172 [2025-01-09 15:47:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:31,086 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 344 transitions. [2025-01-09 15:47:31,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:47:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 344 transitions. [2025-01-09 15:47:31,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 15:47:31,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:31,089 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:31,101 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 (11)] Ended with exit code 0 [2025-01-09 15:47:31,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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:47:31,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:31,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:31,290 INFO L85 PathProgramCache]: Analyzing trace with hash 304075844, now seen corresponding path program 1 times [2025-01-09 15:47:31,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:31,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361830265] [2025-01-09 15:47:31,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:31,291 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:47:31,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:31,296 INFO L229 MonitoredProcess]: Starting monitored process 12 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:47:31,299 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 (12)] Waiting until timeout for monitored process [2025-01-09 15:47:31,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 15:47:31,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 15:47:31,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:31,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:31,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:47:31,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:31,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:31,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:31,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361830265] [2025-01-09 15:47:31,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361830265] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:31,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:31,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:47:31,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645868333] [2025-01-09 15:47:31,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:31,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:47:31,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:31,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:47:31,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:47:31,666 INFO L87 Difference]: Start difference. First operand 253 states and 344 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:31,699 INFO L93 Difference]: Finished difference Result 509 states and 693 transitions. [2025-01-09 15:47:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:47:31,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2025-01-09 15:47:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:31,701 INFO L225 Difference]: With dead ends: 509 [2025-01-09 15:47:31,701 INFO L226 Difference]: Without dead ends: 259 [2025-01-09 15:47:31,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 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:47:31,702 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:31,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 619 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:31,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-01-09 15:47:31,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-01-09 15:47:31,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 211 states have (on average 1.2606635071090047) internal successors, (266), 212 states have internal predecessors, (266), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:47:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 350 transitions. [2025-01-09 15:47:31,714 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 350 transitions. Word has length 174 [2025-01-09 15:47:31,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:31,715 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 350 transitions. [2025-01-09 15:47:31,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 350 transitions. [2025-01-09 15:47:31,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 15:47:31,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:31,716 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:31,725 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 (12)] Ended with exit code 0 [2025-01-09 15:47:31,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:47:31,920 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:31,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash 781117652, now seen corresponding path program 1 times [2025-01-09 15:47:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370315894] [2025-01-09 15:47:31,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:31,921 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:47:31,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:31,923 INFO L229 MonitoredProcess]: Starting monitored process 13 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:47:31,925 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 (13)] Waiting until timeout for monitored process [2025-01-09 15:47:32,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 15:47:32,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 15:47:32,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:32,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:32,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:47:32,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:33,156 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 110 treesize of output 62 [2025-01-09 15:47:33,159 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 50 treesize of output 26 [2025-01-09 15:47:33,219 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:33,219 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:33,219 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:33,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370315894] [2025-01-09 15:47:33,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370315894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:33,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:33,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:47:33,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486870751] [2025-01-09 15:47:33,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:33,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:47:33,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:33,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:47:33,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:47:33,221 INFO L87 Difference]: Start difference. First operand 259 states and 350 transitions. Second operand has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:36,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:36,579 INFO L93 Difference]: Finished difference Result 857 states and 1150 transitions. [2025-01-09 15:47:36,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:47:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2025-01-09 15:47:36,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:36,590 INFO L225 Difference]: With dead ends: 857 [2025-01-09 15:47:36,590 INFO L226 Difference]: Without dead ends: 601 [2025-01-09 15:47:36,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:47:36,592 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 405 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:36,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 886 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 15:47:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-01-09 15:47:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 429. [2025-01-09 15:47:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 334 states have (on average 1.2455089820359282) internal successors, (416), 336 states have internal predecessors, (416), 84 states have call successors, (84), 10 states have call predecessors, (84), 10 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 15:47:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 584 transitions. [2025-01-09 15:47:36,630 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 584 transitions. Word has length 174 [2025-01-09 15:47:36,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:36,631 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 584 transitions. [2025-01-09 15:47:36,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 584 transitions. [2025-01-09 15:47:36,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 15:47:36,633 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:36,634 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:36,645 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 (13)] Forceful destruction successful, exit code 0 [2025-01-09 15:47:36,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:47:36,838 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:36,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1262754879, now seen corresponding path program 1 times [2025-01-09 15:47:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:36,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089813506] [2025-01-09 15:47:36,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:36,839 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:47:36,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:36,841 INFO L229 MonitoredProcess]: Starting monitored process 14 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:47:36,842 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 (14)] Waiting until timeout for monitored process [2025-01-09 15:47:37,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 15:47:37,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 15:47:37,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:37,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:37,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:47:37,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:38,140 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:47:38,213 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 128 treesize of output 92 [2025-01-09 15:47:38,215 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 138 treesize of output 78 [2025-01-09 15:47:38,262 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-01-09 15:47:38,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:47:38,364 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089813506] [2025-01-09 15:47:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089813506] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:47:38,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [547989948] [2025-01-09 15:47:38,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:38,365 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:47:38,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:47:38,367 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:47:38,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-01-09 15:47:38,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 15:47:39,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 15:47:39,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:39,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:39,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 15:47:39,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:40,392 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:47:41,650 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:47:41,784 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 128 treesize of output 92 [2025-01-09 15:47:41,786 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 138 treesize of output 78 [2025-01-09 15:47:41,801 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-01-09 15:47:41,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:47:41,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [547989948] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:47:41,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:47:41,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-01-09 15:47:41,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305776697] [2025-01-09 15:47:41,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:47:41,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 15:47:41,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:41,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 15:47:41,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2025-01-09 15:47:41,861 INFO L87 Difference]: Start difference. First operand 429 states and 584 transitions. Second operand has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2025-01-09 15:47:45,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:45,987 INFO L93 Difference]: Finished difference Result 1141 states and 1549 transitions. [2025-01-09 15:47:45,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 15:47:45,988 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 174 [2025-01-09 15:47:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:45,990 INFO L225 Difference]: With dead ends: 1141 [2025-01-09 15:47:45,991 INFO L226 Difference]: Without dead ends: 715 [2025-01-09 15:47:45,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=301, Invalid=1259, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 15:47:45,992 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 589 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:45,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1490 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 15:47:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-01-09 15:47:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 558. [2025-01-09 15:47:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 421 states have (on average 1.2375296912114013) internal successors, (521), 427 states have internal predecessors, (521), 122 states have call successors, (122), 14 states have call predecessors, (122), 14 states have return successors, (122), 116 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 15:47:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 765 transitions. [2025-01-09 15:47:46,037 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 765 transitions. Word has length 174 [2025-01-09 15:47:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:46,037 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 765 transitions. [2025-01-09 15:47:46,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.1) internal successors, (142), 19 states have internal predecessors, (142), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2025-01-09 15:47:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 765 transitions. [2025-01-09 15:47:46,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 15:47:46,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:46,039 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:46,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2025-01-09 15:47:46,250 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 (14)] Ended with exit code 0 [2025-01-09 15:47:46,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /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:47:46,440 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:46,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash 833096573, now seen corresponding path program 1 times [2025-01-09 15:47:46,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:46,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407055775] [2025-01-09 15:47:46,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:46,441 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:47:46,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:46,445 INFO L229 MonitoredProcess]: Starting monitored process 16 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:47:46,446 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 (16)] Waiting until timeout for monitored process [2025-01-09 15:47:46,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 15:47:46,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 15:47:46,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:46,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:46,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:47:46,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 332 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2025-01-09 15:47:46,821 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:46,821 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:46,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407055775] [2025-01-09 15:47:46,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407055775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:46,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:46,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:47:46,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986170398] [2025-01-09 15:47:46,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:46,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:47:46,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:46,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:47:46,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:47:46,823 INFO L87 Difference]: Start difference. First operand 558 states and 765 transitions. Second operand has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 15:47:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:46,983 INFO L93 Difference]: Finished difference Result 883 states and 1195 transitions. [2025-01-09 15:47:46,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:47:46,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 174 [2025-01-09 15:47:46,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:46,985 INFO L225 Difference]: With dead ends: 883 [2025-01-09 15:47:46,985 INFO L226 Difference]: Without dead ends: 369 [2025-01-09 15:47:46,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:47:46,987 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:46,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 644 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:47:46,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-01-09 15:47:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 357. [2025-01-09 15:47:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 266 states have (on average 1.2255639097744362) internal successors, (326), 270 states have internal predecessors, (326), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 15:47:47,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 486 transitions. [2025-01-09 15:47:47,014 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 486 transitions. Word has length 174 [2025-01-09 15:47:47,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:47,014 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 486 transitions. [2025-01-09 15:47:47,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.6) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 15:47:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 486 transitions. [2025-01-09 15:47:47,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 15:47:47,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:47,015 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:47,038 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 (16)] Ended with exit code 0 [2025-01-09 15:47:47,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:47:47,216 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:47,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash 871177942, now seen corresponding path program 1 times [2025-01-09 15:47:47,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:47,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716631851] [2025-01-09 15:47:47,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:47,217 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:47:47,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:47,221 INFO L229 MonitoredProcess]: Starting monitored process 17 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:47:47,222 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 (17)] Waiting until timeout for monitored process [2025-01-09 15:47:47,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 15:47:47,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 15:47:47,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:47,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:47,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:47:47,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:47,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:47:47,610 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:47,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716631851] [2025-01-09 15:47:47,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716631851] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:47:47,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:47:47,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:47:47,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845921492] [2025-01-09 15:47:47,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:47,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:47:47,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:47,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:47:47,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:47:47,611 INFO L87 Difference]: Start difference. First operand 357 states and 486 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:47,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:47,651 INFO L93 Difference]: Finished difference Result 680 states and 923 transitions. [2025-01-09 15:47:47,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:47:47,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 174 [2025-01-09 15:47:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:47,653 INFO L225 Difference]: With dead ends: 680 [2025-01-09 15:47:47,653 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 15:47:47,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 171 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:47:47,654 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:47,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:47:47,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 15:47:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-01-09 15:47:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 266 states have (on average 1.218045112781955) internal successors, (324), 270 states have internal predecessors, (324), 80 states have call successors, (80), 10 states have call predecessors, (80), 10 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 15:47:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 484 transitions. [2025-01-09 15:47:47,678 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 484 transitions. Word has length 174 [2025-01-09 15:47:47,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:47,678 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 484 transitions. [2025-01-09 15:47:47,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:47,678 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 484 transitions. [2025-01-09 15:47:47,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 15:47:47,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:47,679 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:47,691 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 (17)] Ended with exit code 0 [2025-01-09 15:47:47,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:47:47,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:47,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:47,881 INFO L85 PathProgramCache]: Analyzing trace with hash 880823786, now seen corresponding path program 1 times [2025-01-09 15:47:47,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:47,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236141249] [2025-01-09 15:47:47,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:47,881 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:47:47,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:47,883 INFO L229 MonitoredProcess]: Starting monitored process 18 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:47:47,885 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 (18)] Waiting until timeout for monitored process [2025-01-09 15:47:48,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 15:47:48,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 15:47:48,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:48,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:48,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:47:48,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:49,252 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:47:49,326 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 128 treesize of output 92 [2025-01-09 15:47:49,328 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 140 treesize of output 80 [2025-01-09 15:47:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-01-09 15:47:49,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:47:49,499 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:49,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236141249] [2025-01-09 15:47:49,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236141249] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:47:49,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1751185898] [2025-01-09 15:47:49,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:49,500 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:47:49,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:47:49,502 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:47:49,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2025-01-09 15:47:49,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 15:47:51,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 15:47:51,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:51,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:51,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 15:47:51,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:51,823 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:47:52,908 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:47:53,053 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 128 treesize of output 92 [2025-01-09 15:47:53,055 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 140 treesize of output 80 [2025-01-09 15:47:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-01-09 15:47:53,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:47:53,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1751185898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:47:53,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:47:53,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2025-01-09 15:47:53,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303481923] [2025-01-09 15:47:53,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:47:53,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:47:53,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:53,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:47:53,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:47:53,143 INFO L87 Difference]: Start difference. First operand 357 states and 484 transitions. Second operand has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 16 states have internal predecessors, (137), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 15:47:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:57,508 INFO L93 Difference]: Finished difference Result 803 states and 1076 transitions. [2025-01-09 15:47:57,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:47:57,509 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 16 states have internal predecessors, (137), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 175 [2025-01-09 15:47:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:57,511 INFO L225 Difference]: With dead ends: 803 [2025-01-09 15:47:57,511 INFO L226 Difference]: Without dead ends: 502 [2025-01-09 15:47:57,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 381 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:47:57,512 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 355 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:57,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1550 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 15:47:57,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2025-01-09 15:47:57,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 393. [2025-01-09 15:47:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 296 states have (on average 1.222972972972973) internal successors, (362), 298 states have internal predecessors, (362), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 82 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 15:47:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 530 transitions. [2025-01-09 15:47:57,543 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 530 transitions. Word has length 175 [2025-01-09 15:47:57,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:57,543 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 530 transitions. [2025-01-09 15:47:57,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.058823529411764) internal successors, (137), 16 states have internal predecessors, (137), 4 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 15:47:57,543 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 530 transitions. [2025-01-09 15:47:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 15:47:57,544 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:57,544 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:57,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2025-01-09 15:47:57,758 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 (18)] Ended with exit code 0 [2025-01-09 15:47:57,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /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:47:57,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:57,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1990842311, now seen corresponding path program 1 times [2025-01-09 15:47:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:57,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026658399] [2025-01-09 15:47:57,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:57,946 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:47:57,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:57,948 INFO L229 MonitoredProcess]: Starting monitored process 20 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:47:57,949 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 (20)] Waiting until timeout for monitored process [2025-01-09 15:47:58,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 15:47:58,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 15:47:58,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:58,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:58,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 15:47:58,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:47:58,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:47:58,842 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 145 treesize of output 113 [2025-01-09 15:47:58,845 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 108 treesize of output 88 [2025-01-09 15:47:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:47:58,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:47:59,066 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:47:59,066 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:47:59,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026658399] [2025-01-09 15:47:59,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026658399] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:47:59,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:47:59,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 12 [2025-01-09 15:47:59,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566221374] [2025-01-09 15:47:59,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:47:59,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:47:59,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:47:59,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:47:59,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:47:59,069 INFO L87 Difference]: Start difference. First operand 393 states and 530 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:59,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:47:59,253 INFO L93 Difference]: Finished difference Result 1010 states and 1356 transitions. [2025-01-09 15:47:59,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:47:59,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-01-09 15:47:59,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:47:59,257 INFO L225 Difference]: With dead ends: 1010 [2025-01-09 15:47:59,257 INFO L226 Difference]: Without dead ends: 673 [2025-01-09 15:47:59,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:47:59,259 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 138 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:47:59,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1166 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:47:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-01-09 15:47:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 599. [2025-01-09 15:47:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 458 states have (on average 1.224890829694323) internal successors, (561), 462 states have internal predecessors, (561), 122 states have call successors, (122), 18 states have call predecessors, (122), 18 states have return successors, (122), 118 states have call predecessors, (122), 122 states have call successors, (122) [2025-01-09 15:47:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 805 transitions. [2025-01-09 15:47:59,306 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 805 transitions. Word has length 176 [2025-01-09 15:47:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:47:59,306 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 805 transitions. [2025-01-09 15:47:59,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:47:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 805 transitions. [2025-01-09 15:47:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 15:47:59,308 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:47:59,308 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:59,317 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 (20)] Ended with exit code 0 [2025-01-09 15:47:59,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:47:59,509 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:47:59,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:47:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 466070463, now seen corresponding path program 1 times [2025-01-09 15:47:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:47:59,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063095152] [2025-01-09 15:47:59,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:47:59,510 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:47:59,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:47:59,516 INFO L229 MonitoredProcess]: Starting monitored process 21 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:47:59,519 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 (21)] Waiting until timeout for monitored process [2025-01-09 15:47:59,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 15:47:59,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 15:47:59,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:47:59,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:47:59,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 15:47:59,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:02,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:48:02,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 15:48:02,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 15:48:02,179 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 21 treesize of output 13 [2025-01-09 15:48:02,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 15:48:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 10 proven. 650 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-01-09 15:48:02,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:48:02,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063095152] [2025-01-09 15:48:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063095152] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:02,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:02,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [19] total 22 [2025-01-09 15:48:02,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456166245] [2025-01-09 15:48:02,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:02,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:48:02,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:02,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:48:02,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:48:02,459 INFO L87 Difference]: Start difference. First operand 599 states and 805 transitions. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:02,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:02,645 INFO L93 Difference]: Finished difference Result 1213 states and 1608 transitions. [2025-01-09 15:48:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:48:02,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-01-09 15:48:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:02,652 INFO L225 Difference]: With dead ends: 1213 [2025-01-09 15:48:02,652 INFO L226 Difference]: Without dead ends: 670 [2025-01-09 15:48:02,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:48:02,654 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 98 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:02,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 537 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-01-09 15:48:02,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 666. [2025-01-09 15:48:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 505 states have (on average 1.2079207920792079) internal successors, (610), 511 states have internal predecessors, (610), 134 states have call successors, (134), 26 states have call predecessors, (134), 26 states have return successors, (134), 128 states have call predecessors, (134), 134 states have call successors, (134) [2025-01-09 15:48:02,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 878 transitions. [2025-01-09 15:48:02,726 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 878 transitions. Word has length 176 [2025-01-09 15:48:02,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:02,726 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 878 transitions. [2025-01-09 15:48:02,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:02,726 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 878 transitions. [2025-01-09 15:48:02,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 15:48:02,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:02,728 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:02,737 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 (21)] Forceful destruction successful, exit code 0 [2025-01-09 15:48:02,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:48:02,932 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:02,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:02,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1732676873, now seen corresponding path program 1 times [2025-01-09 15:48:02,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:02,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571273143] [2025-01-09 15:48:02,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:02,933 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:48:02,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:02,937 INFO L229 MonitoredProcess]: Starting monitored process 22 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:48:02,937 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 (22)] Waiting until timeout for monitored process [2025-01-09 15:48:03,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 15:48:03,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 15:48:03,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:03,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:03,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:48:03,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:03,365 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 12 treesize of output 8 [2025-01-09 15:48:03,393 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 34 treesize of output 22 [2025-01-09 15:48:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:48:03,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:48:03,410 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571273143] [2025-01-09 15:48:03,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571273143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:03,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:03,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:48:03,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218465730] [2025-01-09 15:48:03,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:03,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:48:03,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:03,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:48:03,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:03,411 INFO L87 Difference]: Start difference. First operand 666 states and 878 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:03,561 INFO L93 Difference]: Finished difference Result 835 states and 1102 transitions. [2025-01-09 15:48:03,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:48:03,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-01-09 15:48:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:03,565 INFO L225 Difference]: With dead ends: 835 [2025-01-09 15:48:03,565 INFO L226 Difference]: Without dead ends: 833 [2025-01-09 15:48:03,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:48:03,566 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 141 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:03,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1170 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:03,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-01-09 15:48:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 568. [2025-01-09 15:48:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 401 states have (on average 1.172069825436409) internal successors, (470), 405 states have internal predecessors, (470), 144 states have call successors, (144), 22 states have call predecessors, (144), 22 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 15:48:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 758 transitions. [2025-01-09 15:48:03,626 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 758 transitions. Word has length 176 [2025-01-09 15:48:03,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:03,627 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 758 transitions. [2025-01-09 15:48:03,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 758 transitions. [2025-01-09 15:48:03,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 15:48:03,629 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:03,629 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:03,641 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 (22)] Ended with exit code 0 [2025-01-09 15:48:03,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:48:03,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:03,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:03,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1730829831, now seen corresponding path program 1 times [2025-01-09 15:48:03,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:03,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693468410] [2025-01-09 15:48:03,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:03,835 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:48:03,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:03,837 INFO L229 MonitoredProcess]: Starting monitored process 23 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:48:03,839 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 (23)] Waiting until timeout for monitored process [2025-01-09 15:48:04,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 15:48:04,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 15:48:04,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:04,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:04,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:48:04,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:04,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:48:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:48:04,639 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:04,727 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:48:04,728 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:04,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693468410] [2025-01-09 15:48:04,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693468410] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:04,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:04,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-01-09 15:48:04,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581647049] [2025-01-09 15:48:04,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:04,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:04,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:04,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:04,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:04,729 INFO L87 Difference]: Start difference. First operand 568 states and 758 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:04,857 INFO L93 Difference]: Finished difference Result 940 states and 1233 transitions. [2025-01-09 15:48:04,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:04,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-01-09 15:48:04,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:04,860 INFO L225 Difference]: With dead ends: 940 [2025-01-09 15:48:04,860 INFO L226 Difference]: Without dead ends: 584 [2025-01-09 15:48:04,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:04,861 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 117 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:04,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 827 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-01-09 15:48:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 584. [2025-01-09 15:48:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 413 states have (on average 1.1646489104116222) internal successors, (481), 417 states have internal predecessors, (481), 144 states have call successors, (144), 26 states have call predecessors, (144), 26 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 15:48:04,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 769 transitions. [2025-01-09 15:48:04,970 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 769 transitions. Word has length 176 [2025-01-09 15:48:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:04,971 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 769 transitions. [2025-01-09 15:48:04,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 769 transitions. [2025-01-09 15:48:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 15:48:04,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:04,972 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:04,991 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 (23)] Ended with exit code 0 [2025-01-09 15:48:05,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:48:05,173 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:05,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:05,174 INFO L85 PathProgramCache]: Analyzing trace with hash 44177531, now seen corresponding path program 1 times [2025-01-09 15:48:05,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:05,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832057396] [2025-01-09 15:48:05,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:05,178 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:48:05,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:05,180 INFO L229 MonitoredProcess]: Starting monitored process 24 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:48:05,181 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 (24)] Waiting until timeout for monitored process [2025-01-09 15:48:05,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 15:48:05,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 15:48:05,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:05,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:05,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:48:05,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:05,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:48:05,926 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-01-09 15:48:05,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:06,009 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:48:06,009 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:06,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832057396] [2025-01-09 15:48:06,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832057396] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:06,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:06,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 6 [2025-01-09 15:48:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148676127] [2025-01-09 15:48:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:06,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:06,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:06,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:06,014 INFO L87 Difference]: Start difference. First operand 584 states and 769 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:06,156 INFO L93 Difference]: Finished difference Result 972 states and 1255 transitions. [2025-01-09 15:48:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:06,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-01-09 15:48:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:06,160 INFO L225 Difference]: With dead ends: 972 [2025-01-09 15:48:06,160 INFO L226 Difference]: Without dead ends: 600 [2025-01-09 15:48:06,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:06,161 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 107 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:06,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 781 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-01-09 15:48:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-01-09 15:48:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 425 states have (on average 1.1576470588235295) internal successors, (492), 429 states have internal predecessors, (492), 144 states have call successors, (144), 30 states have call predecessors, (144), 30 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 15:48:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 780 transitions. [2025-01-09 15:48:06,225 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 780 transitions. Word has length 176 [2025-01-09 15:48:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:06,225 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 780 transitions. [2025-01-09 15:48:06,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 780 transitions. [2025-01-09 15:48:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 15:48:06,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:06,227 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:06,239 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 (24)] Ended with exit code 0 [2025-01-09 15:48:06,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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:48:06,431 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:06,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:06,431 INFO L85 PathProgramCache]: Analyzing trace with hash 724235901, now seen corresponding path program 1 times [2025-01-09 15:48:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:06,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446579923] [2025-01-09 15:48:06,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:06,432 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:48:06,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:06,434 INFO L229 MonitoredProcess]: Starting monitored process 25 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:48:06,438 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 (25)] Waiting until timeout for monitored process [2025-01-09 15:48:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 15:48:06,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 15:48:06,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:06,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:06,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 15:48:06,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:07,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-01-09 15:48:07,478 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 54 treesize of output 42 [2025-01-09 15:48:07,481 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 54 treesize of output 34 [2025-01-09 15:48:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:48:07,513 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:48:07,626 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:07,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446579923] [2025-01-09 15:48:07,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446579923] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:07,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:07,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2025-01-09 15:48:07,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255213889] [2025-01-09 15:48:07,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:07,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:48:07,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:07,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:48:07,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:48:07,628 INFO L87 Difference]: Start difference. First operand 600 states and 780 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:07,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:07,836 INFO L93 Difference]: Finished difference Result 1316 states and 1674 transitions. [2025-01-09 15:48:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:48:07,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 176 [2025-01-09 15:48:07,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:07,840 INFO L225 Difference]: With dead ends: 1316 [2025-01-09 15:48:07,840 INFO L226 Difference]: Without dead ends: 928 [2025-01-09 15:48:07,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:48:07,841 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 133 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:07,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1169 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-01-09 15:48:07,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 638. [2025-01-09 15:48:07,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 463 states have (on average 1.1684665226781858) internal successors, (541), 467 states have internal predecessors, (541), 144 states have call successors, (144), 30 states have call predecessors, (144), 30 states have return successors, (144), 140 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 15:48:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 829 transitions. [2025-01-09 15:48:07,920 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 829 transitions. Word has length 176 [2025-01-09 15:48:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:07,920 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 829 transitions. [2025-01-09 15:48:07,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 829 transitions. [2025-01-09 15:48:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-01-09 15:48:07,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:07,922 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:07,933 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 (25)] Forceful destruction successful, exit code 0 [2025-01-09 15:48:08,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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:48:08,122 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:08,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:08,123 INFO L85 PathProgramCache]: Analyzing trace with hash -253162556, now seen corresponding path program 1 times [2025-01-09 15:48:08,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:08,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4373075] [2025-01-09 15:48:08,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:08,123 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:48:08,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:08,127 INFO L229 MonitoredProcess]: Starting monitored process 26 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:48:08,128 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 (26)] Waiting until timeout for monitored process [2025-01-09 15:48:08,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 15:48:08,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 15:48:08,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:08,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:08,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 15:48:08,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:09,469 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:48:09,570 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 128 treesize of output 92 [2025-01-09 15:48:09,572 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 138 treesize of output 78 [2025-01-09 15:48:09,636 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-01-09 15:48:09,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:09,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4373075] [2025-01-09 15:48:09,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4373075] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:09,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [320598964] [2025-01-09 15:48:09,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:09,772 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:48:09,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:48:09,775 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:48:09,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2025-01-09 15:48:10,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 15:48:11,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 15:48:11,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:11,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:11,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 15:48:11,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:12,376 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:48:13,888 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:48:14,043 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 128 treesize of output 92 [2025-01-09 15:48:14,045 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 138 treesize of output 78 [2025-01-09 15:48:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-01-09 15:48:14,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:14,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [320598964] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:14,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:48:14,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2025-01-09 15:48:14,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825012510] [2025-01-09 15:48:14,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:48:14,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 15:48:14,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:14,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 15:48:14,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:48:14,131 INFO L87 Difference]: Start difference. First operand 638 states and 829 transitions. Second operand has 25 states, 23 states have (on average 6.391304347826087) internal successors, (147), 22 states have internal predecessors, (147), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2025-01-09 15:48:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:19,823 INFO L93 Difference]: Finished difference Result 1238 states and 1571 transitions. [2025-01-09 15:48:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 15:48:19,824 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 6.391304347826087) internal successors, (147), 22 states have internal predecessors, (147), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) Word has length 177 [2025-01-09 15:48:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:19,827 INFO L225 Difference]: With dead ends: 1238 [2025-01-09 15:48:19,827 INFO L226 Difference]: Without dead ends: 812 [2025-01-09 15:48:19,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 377 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=421, Invalid=2129, Unknown=0, NotChecked=0, Total=2550 [2025-01-09 15:48:19,829 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 781 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:19,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1449 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 15:48:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2025-01-09 15:48:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 517. [2025-01-09 15:48:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 378 states have (on average 1.1719576719576719) internal successors, (443), 384 states have internal predecessors, (443), 116 states have call successors, (116), 22 states have call predecessors, (116), 22 states have return successors, (116), 110 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 15:48:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 675 transitions. [2025-01-09 15:48:19,887 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 675 transitions. Word has length 177 [2025-01-09 15:48:19,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:19,888 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 675 transitions. [2025-01-09 15:48:19,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 6.391304347826087) internal successors, (147), 22 states have internal predecessors, (147), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 4 states have call predecessors, (42), 6 states have call successors, (42) [2025-01-09 15:48:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 675 transitions. [2025-01-09 15:48:19,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 15:48:19,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:19,889 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:19,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2025-01-09 15:48:20,103 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 (26)] Ended with exit code 0 [2025-01-09 15:48:20,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /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:48:20,290 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:20,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash 199884559, now seen corresponding path program 1 times [2025-01-09 15:48:20,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:20,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130860246] [2025-01-09 15:48:20,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:20,291 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:48:20,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:20,294 INFO L229 MonitoredProcess]: Starting monitored process 28 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:48:20,298 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 (28)] Waiting until timeout for monitored process [2025-01-09 15:48:20,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 15:48:20,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 15:48:20,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:20,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:20,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 15:48:20,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:21,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-01-09 15:48:21,169 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 13 treesize of output 9 [2025-01-09 15:48:21,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-01-09 15:48:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:48:21,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:21,344 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:48:21,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-01-09 15:48:21,567 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 15:48:21,567 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:21,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130860246] [2025-01-09 15:48:21,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130860246] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:21,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:21,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-01-09 15:48:21,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523845372] [2025-01-09 15:48:21,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:21,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:48:21,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:21,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:48:21,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:48:21,569 INFO L87 Difference]: Start difference. First operand 517 states and 675 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:48:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:22,006 INFO L93 Difference]: Finished difference Result 1051 states and 1340 transitions. [2025-01-09 15:48:22,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:48:22,006 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2025-01-09 15:48:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:22,009 INFO L225 Difference]: With dead ends: 1051 [2025-01-09 15:48:22,009 INFO L226 Difference]: Without dead ends: 746 [2025-01-09 15:48:22,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 344 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:48:22,011 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 605 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:22,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 672 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:48:22,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-01-09 15:48:22,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 510. [2025-01-09 15:48:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 371 states have (on average 1.1671159029649596) internal successors, (433), 377 states have internal predecessors, (433), 116 states have call successors, (116), 22 states have call predecessors, (116), 22 states have return successors, (116), 110 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 15:48:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 665 transitions. [2025-01-09 15:48:22,071 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 665 transitions. Word has length 178 [2025-01-09 15:48:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:22,071 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 665 transitions. [2025-01-09 15:48:22,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 9 states have internal predecessors, (79), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:48:22,071 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 665 transitions. [2025-01-09 15:48:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 15:48:22,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:22,073 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,086 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 (28)] Ended with exit code 0 [2025-01-09 15:48:22,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /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:48:22,277 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:22,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash -456209048, now seen corresponding path program 1 times [2025-01-09 15:48:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:22,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203310082] [2025-01-09 15:48:22,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:22,278 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:48:22,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:22,282 INFO L229 MonitoredProcess]: Starting monitored process 29 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:48:22,284 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 (29)] Waiting until timeout for monitored process [2025-01-09 15:48:22,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 15:48:22,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 15:48:22,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:22,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:22,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:48:22,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:23,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2025-01-09 15:48:23,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:48:23,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 51 [2025-01-09 15:48:23,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 28 [2025-01-09 15:48:23,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 4 [2025-01-09 15:48:23,202 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:48:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 15:48:23,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:23,250 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 40 treesize of output 36 [2025-01-09 15:48:23,252 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 15:48:23,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:48:23,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 52 [2025-01-09 15:48:23,363 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-01-09 15:48:23,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-01-09 15:48:23,596 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 15:48:23,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:23,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203310082] [2025-01-09 15:48:23,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203310082] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:23,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:23,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2025-01-09 15:48:23,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534612077] [2025-01-09 15:48:23,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:23,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:48:23,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:23,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:48:23,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:48:23,598 INFO L87 Difference]: Start difference. First operand 510 states and 665 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:48:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:24,130 INFO L93 Difference]: Finished difference Result 1041 states and 1326 transitions. [2025-01-09 15:48:24,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:48:24,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 179 [2025-01-09 15:48:24,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:24,134 INFO L225 Difference]: With dead ends: 1041 [2025-01-09 15:48:24,134 INFO L226 Difference]: Without dead ends: 743 [2025-01-09 15:48:24,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:48:24,135 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 772 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:24,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 471 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:48:24,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-01-09 15:48:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 507. [2025-01-09 15:48:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 368 states have (on average 1.1657608695652173) internal successors, (429), 374 states have internal predecessors, (429), 116 states have call successors, (116), 22 states have call predecessors, (116), 22 states have return successors, (116), 110 states have call predecessors, (116), 116 states have call successors, (116) [2025-01-09 15:48:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 661 transitions. [2025-01-09 15:48:24,199 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 661 transitions. Word has length 179 [2025-01-09 15:48:24,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:24,200 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 661 transitions. [2025-01-09 15:48:24,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 9 states have internal predecessors, (80), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 15:48:24,201 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 661 transitions. [2025-01-09 15:48:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 15:48:24,202 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:24,202 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:24,212 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 (29)] Ended with exit code 0 [2025-01-09 15:48:24,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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:48:24,407 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:24,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:24,407 INFO L85 PathProgramCache]: Analyzing trace with hash -336345286, now seen corresponding path program 1 times [2025-01-09 15:48:24,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:24,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063897731] [2025-01-09 15:48:24,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:24,408 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:48:24,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:24,410 INFO L229 MonitoredProcess]: Starting monitored process 30 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:48:24,411 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 (30)] Waiting until timeout for monitored process [2025-01-09 15:48:24,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 15:48:24,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 15:48:24,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:24,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:24,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-09 15:48:24,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:28,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 15:48:28,863 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 37 treesize of output 33 [2025-01-09 15:48:29,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2025-01-09 15:48:29,118 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 38 treesize of output 30 [2025-01-09 15:48:29,241 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 56 treesize of output 40 [2025-01-09 15:48:29,376 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 102 treesize of output 82 [2025-01-09 15:48:29,567 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 706 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-01-09 15:48:29,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:48:30,225 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:30,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063897731] [2025-01-09 15:48:30,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063897731] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:30,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:30,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [39] total 47 [2025-01-09 15:48:30,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994104550] [2025-01-09 15:48:30,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:30,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:48:30,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:30,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:48:30,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2023, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 15:48:30,227 INFO L87 Difference]: Start difference. First operand 507 states and 661 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:30,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:30,980 INFO L93 Difference]: Finished difference Result 967 states and 1227 transitions. [2025-01-09 15:48:30,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:48:30,981 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 181 [2025-01-09 15:48:30,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:30,984 INFO L225 Difference]: With dead ends: 967 [2025-01-09 15:48:30,984 INFO L226 Difference]: Without dead ends: 672 [2025-01-09 15:48:30,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=170, Invalid=2692, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 15:48:30,989 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 94 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:30,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 2029 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:48:30,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2025-01-09 15:48:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 648. [2025-01-09 15:48:31,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 495 states have (on average 1.1818181818181819) internal successors, (585), 503 states have internal predecessors, (585), 126 states have call successors, (126), 26 states have call predecessors, (126), 26 states have return successors, (126), 118 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 15:48:31,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 837 transitions. [2025-01-09 15:48:31,078 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 837 transitions. Word has length 181 [2025-01-09 15:48:31,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:31,079 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 837 transitions. [2025-01-09 15:48:31,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 837 transitions. [2025-01-09 15:48:31,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 15:48:31,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:31,080 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:31,090 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 (30)] Ended with exit code 0 [2025-01-09 15:48:31,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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:48:31,284 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:31,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1357413640, now seen corresponding path program 1 times [2025-01-09 15:48:31,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:31,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899151973] [2025-01-09 15:48:31,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:31,285 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:48:31,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:31,287 INFO L229 MonitoredProcess]: Starting monitored process 31 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:48:31,289 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 (31)] Waiting until timeout for monitored process [2025-01-09 15:48:31,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 15:48:31,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 15:48:31,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:31,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:31,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 15:48:31,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:33,296 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 42 treesize of output 26 [2025-01-09 15:48:33,299 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 20 treesize of output 12 [2025-01-09 15:48:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 509 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-09 15:48:33,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:48:33,541 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:33,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899151973] [2025-01-09 15:48:33,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899151973] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:33,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:33,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2025-01-09 15:48:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725317791] [2025-01-09 15:48:33,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:33,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:33,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:33,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:48:33,543 INFO L87 Difference]: Start difference. First operand 648 states and 837 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:33,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:33,727 INFO L93 Difference]: Finished difference Result 1171 states and 1470 transitions. [2025-01-09 15:48:33,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:33,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 181 [2025-01-09 15:48:33,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:33,731 INFO L225 Difference]: With dead ends: 1171 [2025-01-09 15:48:33,731 INFO L226 Difference]: Without dead ends: 735 [2025-01-09 15:48:33,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:48:33,732 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 105 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:33,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 642 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:33,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2025-01-09 15:48:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 607. [2025-01-09 15:48:33,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 472 states have (on average 1.1864406779661016) internal successors, (560), 478 states have internal predecessors, (560), 108 states have call successors, (108), 26 states have call predecessors, (108), 26 states have return successors, (108), 102 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 15:48:33,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 776 transitions. [2025-01-09 15:48:33,802 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 776 transitions. Word has length 181 [2025-01-09 15:48:33,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:33,802 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 776 transitions. [2025-01-09 15:48:33,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 776 transitions. [2025-01-09 15:48:33,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 15:48:33,804 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:33,804 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:33,815 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 (31)] Ended with exit code 0 [2025-01-09 15:48:34,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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:48:34,008 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:34,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:34,009 INFO L85 PathProgramCache]: Analyzing trace with hash -470358792, now seen corresponding path program 1 times [2025-01-09 15:48:34,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:34,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602700520] [2025-01-09 15:48:34,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:34,009 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:48:34,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:34,011 INFO L229 MonitoredProcess]: Starting monitored process 32 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:48:34,012 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 (32)] Waiting until timeout for monitored process [2025-01-09 15:48:34,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 15:48:34,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 15:48:34,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:34,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:34,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 15:48:34,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:36,078 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 34 treesize of output 22 [2025-01-09 15:48:36,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2025-01-09 15:48:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 509 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-09 15:48:36,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 15:48:36,313 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:36,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602700520] [2025-01-09 15:48:36,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602700520] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:36,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:36,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2025-01-09 15:48:36,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953435920] [2025-01-09 15:48:36,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:36,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:36,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:36,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:36,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:48:36,314 INFO L87 Difference]: Start difference. First operand 607 states and 776 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:36,528 INFO L93 Difference]: Finished difference Result 1199 states and 1512 transitions. [2025-01-09 15:48:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:36,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 181 [2025-01-09 15:48:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:36,536 INFO L225 Difference]: With dead ends: 1199 [2025-01-09 15:48:36,537 INFO L226 Difference]: Without dead ends: 780 [2025-01-09 15:48:36,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:48:36,542 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 186 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:36,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 648 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-01-09 15:48:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 607. [2025-01-09 15:48:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 472 states have (on average 1.1843220338983051) internal successors, (559), 478 states have internal predecessors, (559), 108 states have call successors, (108), 26 states have call predecessors, (108), 26 states have return successors, (108), 102 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 15:48:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 775 transitions. [2025-01-09 15:48:36,679 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 775 transitions. Word has length 181 [2025-01-09 15:48:36,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:36,680 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 775 transitions. [2025-01-09 15:48:36,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 15:48:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 775 transitions. [2025-01-09 15:48:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 15:48:36,685 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:36,685 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:36,695 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 (32)] Ended with exit code 0 [2025-01-09 15:48:36,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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:48:36,886 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:36,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:36,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1491427146, now seen corresponding path program 1 times [2025-01-09 15:48:36,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:36,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984965698] [2025-01-09 15:48:36,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:36,887 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:48:36,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:36,890 INFO L229 MonitoredProcess]: Starting monitored process 33 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:48:36,892 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 (33)] Waiting until timeout for monitored process [2025-01-09 15:48:37,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 15:48:37,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 15:48:37,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:37,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:37,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 15:48:37,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:38,375 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 37 treesize of output 33 [2025-01-09 15:48:38,412 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 42 treesize of output 34 [2025-01-09 15:48:38,418 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 38 treesize of output 30 [2025-01-09 15:48:38,460 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 36 treesize of output 28 [2025-01-09 15:48:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 624 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2025-01-09 15:48:38,575 INFO L312 TraceCheckSpWp]: Computing backward predicates...