./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:26:29,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:26:29,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:26:29,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:26:29,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:26:29,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:26:29,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:26:29,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:26:29,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:26:29,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:26:29,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:26:29,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:26:29,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:26:29,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:26:29,275 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:26:29,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:26:29,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:26:29,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:26:29,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:26:29,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:26:29,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:26:29,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:26:29,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:26:29,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:26:29,277 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:26:29,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:26:29,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:26:29,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:26:29,278 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 [2025-03-04 01:26:29,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:26:29,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:26:29,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:26:29,496 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:26:29,496 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:26:29,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2025-03-04 01:26:30,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca5cc5b2f/3e1ac1f32bcb40a1847eca0849d30f15/FLAGc09c34674 [2025-03-04 01:26:30,899 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:26:30,900 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2025-03-04 01:26:30,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca5cc5b2f/3e1ac1f32bcb40a1847eca0849d30f15/FLAGc09c34674 [2025-03-04 01:26:31,234 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca5cc5b2f/3e1ac1f32bcb40a1847eca0849d30f15 [2025-03-04 01:26:31,236 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:26:31,237 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:26:31,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:26:31,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:26:31,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:26:31,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6350a18e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31, skipping insertion in model container [2025-03-04 01:26:31,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:26:31,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i[916,929] [2025-03-04 01:26:31,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:26:31,420 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:26:31,429 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i[916,929] [2025-03-04 01:26:31,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:26:31,481 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:26:31,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31 WrapperNode [2025-03-04 01:26:31,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:26:31,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:26:31,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:26:31,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:26:31,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,515 INFO L138 Inliner]: procedures = 29, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 613 [2025-03-04 01:26:31,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:26:31,516 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:26:31,516 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:26:31,516 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:26:31,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,544 INFO L175 MemorySlicer]: Split 152 memory accesses to 16 slices as follows [2, 5, 8, 8, 22, 20, 12, 5, 14, 14, 3, 5, 8, 6, 3, 17]. 14 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1]. [2025-03-04 01:26:31,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,556 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,560 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,562 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:26:31,566 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:26:31,566 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:26:31,566 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:26:31,567 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (1/1) ... [2025-03-04 01:26:31,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:26:31,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:26:31,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:26:31,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:26:31,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:26:31,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:26:31,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:26:31,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:26:31,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:26:31,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:26:31,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:26:31,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:26:31,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:26:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:26:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:26:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:26:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:26:31,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:26:31,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:26:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:26:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:26:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:26:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:26:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-04 01:26:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-04 01:26:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-04 01:26:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-04 01:26:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-04 01:26:31,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-04 01:26:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-04 01:26:31,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:26:31,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:26:31,624 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:26:31,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 01:26:31,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:26:31,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:26:31,802 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:26:31,803 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:26:32,216 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite110#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem115#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short123#1;havoc property_#t~mem129#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~short130#1;havoc property_#t~mem131#1;havoc property_#t~bitwise132#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite137#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite159#1;havoc property_#t~mem150#1;havoc property_#t~mem140#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~ite144#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~mem149#1;havoc property_#t~mem145#1;havoc property_#t~ite148#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~mem158#1;havoc property_#t~mem157#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem156#1;havoc property_#t~short160#1;havoc property_#t~mem162#1;havoc property_#t~mem161#1;havoc property_#t~short163#1;havoc property_#t~mem165#1;havoc property_#t~mem164#1;havoc property_#t~short166#1; [2025-03-04 01:26:32,270 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-03-04 01:26:32,270 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:26:32,282 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:26:32,284 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:26:32,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:26:32 BoogieIcfgContainer [2025-03-04 01:26:32,284 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:26:32,286 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:26:32,287 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:26:32,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:26:32,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:26:31" (1/3) ... [2025-03-04 01:26:32,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222ab88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:26:32, skipping insertion in model container [2025-03-04 01:26:32,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:31" (2/3) ... [2025-03-04 01:26:32,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@222ab88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:26:32, skipping insertion in model container [2025-03-04 01:26:32,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:26:32" (3/3) ... [2025-03-04 01:26:32,292 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-28.i [2025-03-04 01:26:32,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:26:32,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-28.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:26:32,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:26:32,368 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;@2360fe7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:26:32,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:26:32,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:32,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:26:32,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:32,381 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:32,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:32,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1340237576, now seen corresponding path program 1 times [2025-03-04 01:26:32,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:26:32,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708014404] [2025-03-04 01:26:32,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:26:32,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:26:32,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:26:32,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:32,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:26:32,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:26:32,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708014404] [2025-03-04 01:26:32,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708014404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:32,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091209221] [2025-03-04 01:26:32,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:32,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:26:32,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:26:32,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:26:32,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:26:32,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:26:32,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:26:32,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:32,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:32,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:26:32,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:26:32,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:32,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091209221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:32,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:26:32,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:26:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628101426] [2025-03-04 01:26:32,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:32,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:26:32,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:26:32,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:26:32,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:26:32,976 INFO L87 Difference]: Start difference. First operand has 122 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:26:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:32,997 INFO L93 Difference]: Finished difference Result 238 states and 365 transitions. [2025-03-04 01:26:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:26:32,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-04 01:26:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:33,003 INFO L225 Difference]: With dead ends: 238 [2025-03-04 01:26:33,003 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:26:33,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:26:33,007 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:33,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:26:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:26:33,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 01:26:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3883495145631068) internal successors, (143), 103 states have internal predecessors, (143), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 171 transitions. [2025-03-04 01:26:33,042 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 171 transitions. Word has length 130 [2025-03-04 01:26:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:33,042 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 171 transitions. [2025-03-04 01:26:33,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:26:33,043 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 171 transitions. [2025-03-04 01:26:33,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:26:33,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:33,046 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:33,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:26:33,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:26:33,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:33,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:33,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1113731566, now seen corresponding path program 1 times [2025-03-04 01:26:33,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:26:33,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738659887] [2025-03-04 01:26:33,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:33,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:26:33,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:26:33,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:26:33,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:33,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:33,538 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:26:33,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:26:33,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738659887] [2025-03-04 01:26:33,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738659887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:33,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:33,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:26:33,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245662775] [2025-03-04 01:26:33,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:33,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:26:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:26:33,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:26:33,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:26:33,543 INFO L87 Difference]: Start difference. First operand 119 states and 171 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:33,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:33,593 INFO L93 Difference]: Finished difference Result 238 states and 343 transitions. [2025-03-04 01:26:33,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:26:33,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-03-04 01:26:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:33,595 INFO L225 Difference]: With dead ends: 238 [2025-03-04 01:26:33,595 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:26:33,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:26:33,596 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:33,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:26:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:26:33,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-04 01:26:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 105 states have (on average 1.380952380952381) internal successors, (145), 105 states have internal predecessors, (145), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:33,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 173 transitions. [2025-03-04 01:26:33,612 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 173 transitions. Word has length 130 [2025-03-04 01:26:33,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:33,613 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 173 transitions. [2025-03-04 01:26:33,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 173 transitions. [2025-03-04 01:26:33,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:26:33,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:33,616 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:33,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:26:33,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:33,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:33,617 INFO L85 PathProgramCache]: Analyzing trace with hash -226227885, now seen corresponding path program 1 times [2025-03-04 01:26:33,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:26:33,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397188233] [2025-03-04 01:26:33,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:33,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:26:33,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:26:33,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:26:33,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:33,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:33,778 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:26:33,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:26:33,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397188233] [2025-03-04 01:26:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397188233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:33,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:33,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:26:33,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248557327] [2025-03-04 01:26:33,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:33,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:26:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:26:33,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:26:33,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:26:33,779 INFO L87 Difference]: Start difference. First operand 121 states and 173 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:33,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:33,811 INFO L93 Difference]: Finished difference Result 242 states and 347 transitions. [2025-03-04 01:26:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:26:33,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-03-04 01:26:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:33,814 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:26:33,814 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 01:26:33,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:26:33,817 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:33,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 490 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:26:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 01:26:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-03-04 01:26:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 107 states have (on average 1.3738317757009346) internal successors, (147), 107 states have internal predecessors, (147), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2025-03-04 01:26:33,830 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 130 [2025-03-04 01:26:33,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:33,830 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2025-03-04 01:26:33,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2025-03-04 01:26:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:26:33,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:33,832 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:33,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:26:33,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:33,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash -225304364, now seen corresponding path program 1 times [2025-03-04 01:26:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:26:33,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005372905] [2025-03-04 01:26:33,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:33,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:26:33,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:26:33,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:26:33,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:33,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:34,172 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:26:34,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:26:34,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005372905] [2025-03-04 01:26:34,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005372905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:34,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:34,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:26:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316807515] [2025-03-04 01:26:34,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:34,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:26:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:26:34,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:26:34,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:26:34,176 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:34,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:34,308 INFO L93 Difference]: Finished difference Result 321 states and 455 transitions. [2025-03-04 01:26:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:26:34,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-03-04 01:26:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:34,310 INFO L225 Difference]: With dead ends: 321 [2025-03-04 01:26:34,310 INFO L226 Difference]: Without dead ends: 201 [2025-03-04 01:26:34,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:26:34,311 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 94 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:34,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 788 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:26:34,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-03-04 01:26:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2025-03-04 01:26:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 179 states have (on average 1.3854748603351956) internal successors, (248), 180 states have internal predecessors, (248), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:26:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 280 transitions. [2025-03-04 01:26:34,326 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 280 transitions. Word has length 130 [2025-03-04 01:26:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:34,327 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 280 transitions. [2025-03-04 01:26:34,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 280 transitions. [2025-03-04 01:26:34,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:26:34,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:34,331 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:34,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:26:34,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:34,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:34,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1904684778, now seen corresponding path program 1 times [2025-03-04 01:26:34,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:26:34,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452274399] [2025-03-04 01:26:34,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:34,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:26:34,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:26:34,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:26:34,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:34,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:34,608 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:26:34,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:26:34,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452274399] [2025-03-04 01:26:34,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452274399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:34,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:34,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:26:34,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700650847] [2025-03-04 01:26:34,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:34,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:26:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:26:34,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:26:34,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:26:34,610 INFO L87 Difference]: Start difference. First operand 198 states and 280 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:34,742 INFO L93 Difference]: Finished difference Result 554 states and 782 transitions. [2025-03-04 01:26:34,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:26:34,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 132 [2025-03-04 01:26:34,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:34,745 INFO L225 Difference]: With dead ends: 554 [2025-03-04 01:26:34,745 INFO L226 Difference]: Without dead ends: 359 [2025-03-04 01:26:34,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:26:34,746 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 113 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:34,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 769 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:26:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-04 01:26:34,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2025-03-04 01:26:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 329 states have (on average 1.3890577507598785) internal successors, (457), 332 states have internal predecessors, (457), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:26:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 501 transitions. [2025-03-04 01:26:34,775 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 501 transitions. Word has length 132 [2025-03-04 01:26:34,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:34,776 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 501 transitions. [2025-03-04 01:26:34,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 501 transitions. [2025-03-04 01:26:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:26:34,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:34,778 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:34,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:26:34,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:34,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:34,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1706263752, now seen corresponding path program 1 times [2025-03-04 01:26:34,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:26:34,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109629443] [2025-03-04 01:26:34,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:34,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:26:34,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:26:34,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:26:34,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:34,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:26:35,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:26:35,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109629443] [2025-03-04 01:26:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109629443] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:35,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:35,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:26:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501487616] [2025-03-04 01:26:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:35,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:26:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:26:35,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:26:35,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:26:35,005 INFO L87 Difference]: Start difference. First operand 356 states and 501 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:35,038 INFO L93 Difference]: Finished difference Result 709 states and 999 transitions. [2025-03-04 01:26:35,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:26:35,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2025-03-04 01:26:35,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:35,044 INFO L225 Difference]: With dead ends: 709 [2025-03-04 01:26:35,046 INFO L226 Difference]: Without dead ends: 356 [2025-03-04 01:26:35,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:26:35,048 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:35,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 319 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:26:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-04 01:26:35,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-04 01:26:35,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 329 states have (on average 1.3768996960486322) internal successors, (453), 332 states have internal predecessors, (453), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 19 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:26:35,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 497 transitions. [2025-03-04 01:26:35,060 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 497 transitions. Word has length 134 [2025-03-04 01:26:35,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:35,060 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 497 transitions. [2025-03-04 01:26:35,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:35,060 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 497 transitions. [2025-03-04 01:26:35,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:26:35,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:35,062 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:35,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:26:35,062 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:35,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1591631191, now seen corresponding path program 1 times [2025-03-04 01:26:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:26:35,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541312122] [2025-03-04 01:26:35,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:35,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:26:35,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:26:35,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:26:35,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:35,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:26:35,166 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:26:35,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:26:35,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:26:35,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:35,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:26:35,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:26:35,301 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:26:35,302 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:26:35,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:26:35,305 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:35,460 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:26:35,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:26:35 BoogieIcfgContainer [2025-03-04 01:26:35,462 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:26:35,463 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:26:35,463 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:26:35,463 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:26:35,463 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:26:32" (3/4) ... [2025-03-04 01:26:35,465 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:26:35,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:26:35,466 INFO L158 Benchmark]: Toolchain (without parser) took 4228.61ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 111.2MB in the beginning and 110.8MB in the end (delta: 414.2kB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. [2025-03-04 01:26:35,466 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:26:35,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.16ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 96.6MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:26:35,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.63ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 93.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:26:35,467 INFO L158 Benchmark]: Boogie Preprocessor took 49.33ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 88.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:26:35,467 INFO L158 Benchmark]: IcfgBuilder took 718.41ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 45.1MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-04 01:26:35,467 INFO L158 Benchmark]: TraceAbstraction took 3176.56ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 45.1MB in the beginning and 113.9MB in the end (delta: -68.8MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. [2025-03-04 01:26:35,467 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 293.6MB. Free memory was 113.9MB in the beginning and 110.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:26:35,468 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.16ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 96.6MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.63ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 93.3MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.33ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 88.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 718.41ms. Allocated memory is still 142.6MB. Free memory was 88.2MB in the beginning and 45.1MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3176.56ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 45.1MB in the beginning and 113.9MB in the end (delta: -68.8MB). Peak memory consumption was 77.0MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 293.6MB. Free memory was 113.9MB in the beginning and 110.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 57, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 59, overapproximation of someBinaryFLOATComparisonOperation at line 62, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryFLOATComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L22] signed char var_1_1 = 1; [L23] signed char* var_1_1_Pointer = &(var_1_1); [L24] float var_1_2 = 63.75; [L24] float var_1_2 = 63.75; [L25] float* var_1_2_Pointer = &(var_1_2); [L26] float var_1_3 = 255.75; [L26] float var_1_3 = 255.75; [L27] float* var_1_3_Pointer = &(var_1_3); [L28] signed char var_1_5 = 10; [L28] signed char var_1_5 = 10; [L29] signed char* var_1_5_Pointer = &(var_1_5); [L30] signed char var_1_6 = 4; [L30] signed char var_1_6 = 4; [L31] signed char* var_1_6_Pointer = &(var_1_6); [L32] signed char var_1_7 = -10; [L32] signed char var_1_7 = -10; [L33] signed char* var_1_7_Pointer = &(var_1_7); [L34] float var_1_8 = 4.75; [L34] float var_1_8 = 4.75; [L35] float* var_1_8_Pointer = &(var_1_8); [L36] float var_1_9 = 99.5; [L36] float var_1_9 = 99.5; [L37] float* var_1_9_Pointer = &(var_1_9); [L38] float var_1_10 = 255.9; [L38] float var_1_10 = 255.9; [L39] float* var_1_10_Pointer = &(var_1_10); [L40] float var_1_11 = 24.85; [L40] float var_1_11 = 24.85; [L41] float* var_1_11_Pointer = &(var_1_11); [L42] signed long int var_1_12 = -2; [L42] signed long int var_1_12 = -2; [L43] signed long int* var_1_12_Pointer = &(var_1_12); [L44] signed long int var_1_13 = 1629954775; [L44] signed long int var_1_13 = 1629954775; [L45] signed long int* var_1_13_Pointer = &(var_1_13); [L46] signed long int var_1_15 = 1928642731; [L46] signed long int var_1_15 = 1928642731; [L47] signed long int* var_1_15_Pointer = &(var_1_15); [L48] signed short int var_1_18 = 0; [L48] signed short int var_1_18 = 0; [L49] signed short int* var_1_18_Pointer = &(var_1_18); [L50] unsigned short int var_1_19 = 5; [L50] unsigned short int var_1_19 = 5; [L51] unsigned short int* var_1_19_Pointer = &(var_1_19); VAL [isInitial=0, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_float() [L76] EXPR \read(var_1_2) [L76] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F [L76] EXPR \read(var_1_2) [L76] EXPR var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] EXPR (var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] EXPR (var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L76] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L77] var_1_3 = __VERIFIER_nondet_float() [L78] EXPR \read(var_1_3) [L78] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F [L78] EXPR \read(var_1_3) [L78] EXPR var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] EXPR (var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] EXPR (var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L78] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L79] var_1_5 = __VERIFIER_nondet_char() [L80] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L80] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L80] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] EXPR \read(var_1_5) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L81] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L82] var_1_6 = __VERIFIER_nondet_char() [L83] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L83] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] EXPR \read(var_1_6) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L84] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L85] var_1_7 = __VERIFIER_nondet_char() [L86] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L86] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] EXPR \read(var_1_7) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L87] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L88] var_1_9 = __VERIFIER_nondet_float() [L89] EXPR \read(var_1_9) [L89] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F [L89] EXPR \read(var_1_9) [L89] EXPR var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] EXPR (var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L89] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L90] var_1_10 = __VERIFIER_nondet_float() [L91] EXPR \read(var_1_10) [L91] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F [L91] EXPR \read(var_1_10) [L91] EXPR var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] EXPR (var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F ) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L91] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L92] var_1_13 = __VERIFIER_nondet_long() [L93] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] CALL assume_abort_if_not(var_1_13 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L93] RET assume_abort_if_not(var_1_13 >= 1073741822) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] EXPR \read(var_1_13) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L94] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L95] var_1_15 = __VERIFIER_nondet_long() [L96] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L96] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] EXPR \read(var_1_15) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L97] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L110] RET updateVariables() [L111] CALL step() [L55] signed long int stepLocal_0 = -4; [L56] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L56] COND TRUE stepLocal_0 < (*(var_1_6_Pointer)) [L57] EXPR \read(*var_1_9_Pointer) [L57] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] EXPR (((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) [L57] EXPR \read(*var_1_9_Pointer) [L57] EXPR (((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L57] (*(var_1_8_Pointer)) = (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR \read(*var_1_10_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L59] EXPR (((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) [L59] EXPR \read(*var_1_10_Pointer) [L59] EXPR (((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L59] (*(var_1_11_Pointer)) = (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))) [L60] EXPR \read(*var_1_5_Pointer) [L60] (*(var_1_18_Pointer)) = (*(var_1_5_Pointer)) [L61] EXPR \read(*var_1_6_Pointer) [L61] (*(var_1_19_Pointer)) = (*(var_1_6_Pointer)) [L62] EXPR \read(*var_1_2_Pointer) [L62] EXPR \read(*var_1_3_Pointer) [L62] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L62] COND TRUE ((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer))) [L63] EXPR \read(*var_1_5_Pointer) [L63] EXPR \read(*var_1_6_Pointer) [L63] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L63] EXPR ((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))) [L63] EXPR \read(*var_1_5_Pointer) [L63] EXPR \read(*var_1_6_Pointer) [L63] EXPR ((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L63] (*(var_1_1_Pointer)) = ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))) [L67] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] EXPR (*(var_1_6_Pointer)) | 5 VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L67] signed long int stepLocal_1 = (*(var_1_6_Pointer)) | 5; [L68] EXPR \read(*var_1_5_Pointer) [L68] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L68] EXPR (((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer))) [L68] EXPR \read(*var_1_7_Pointer) [L68] EXPR (((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, stepLocal_1=5, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L68] COND FALSE !(stepLocal_1 <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) [L71] EXPR \read(*var_1_6_Pointer) [L71] EXPR \read(*var_1_19_Pointer) [L71] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L71] EXPR (((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))) [L71] EXPR \read(*var_1_19_Pointer) [L71] EXPR (((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L71] EXPR \read(*var_1_19_Pointer) [L71] (*(var_1_12_Pointer)) = ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR \read(*var_1_2_Pointer) [L102] EXPR \read(*var_1_3_Pointer) [L102] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) [L102] EXPR \read(*var_1_1_Pointer) [L102] EXPR \read(*var_1_5_Pointer) [L102] EXPR (((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer))))))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR (((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102] EXPR ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L102-L103] return ((((((((*(var_1_2_Pointer)) - (*(var_1_3_Pointer))) <= (- (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed char) ((((((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) < ((*(var_1_7_Pointer)))) ? (((*(var_1_5_Pointer)) - (*(var_1_6_Pointer)))) : ((*(var_1_7_Pointer))))))) : ((*(var_1_1_Pointer)) == ((signed char) (*(var_1_5_Pointer))))) && ((-4 < (*(var_1_6_Pointer))) ? ((*(var_1_8_Pointer)) == ((float) (((((*(var_1_9_Pointer))) < ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer))))))) : 1)) && ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_9_Pointer))) > ((*(var_1_10_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_10_Pointer)))))))) && ((((*(var_1_6_Pointer)) | 5) <= (((((*(var_1_5_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_5_Pointer))) : ((*(var_1_7_Pointer)))))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((*(var_1_6_Pointer))) < (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer))))) ? ((*(var_1_6_Pointer))) : (((*(var_1_13_Pointer)) - (*(var_1_19_Pointer)))))) - ((*(var_1_15_Pointer)) - (((((*(var_1_5_Pointer))) < 0 ) ? -((*(var_1_5_Pointer))) : ((*(var_1_5_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) ((*(var_1_6_Pointer)) + ((((((*(var_1_19_Pointer))) < ((*(var_1_19_Pointer)))) ? ((*(var_1_19_Pointer))) : ((*(var_1_19_Pointer))))) - (*(var_1_19_Pointer)))))))) && ((*(var_1_18_Pointer)) == ((signed short int) (*(var_1_5_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] [L19] reach_error() VAL [isInitial=1, var_1_10={12:0}, var_1_10_Pointer={12:0}, var_1_11={13:0}, var_1_11_Pointer={13:0}, var_1_12={14:0}, var_1_12_Pointer={14:0}, var_1_13={15:0}, var_1_13_Pointer={15:0}, var_1_15={16:0}, var_1_15_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_19={18:0}, var_1_19_Pointer={18:0}, var_1_1={4:0}, var_1_1_Pointer={4: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_5={7:0}, var_1_5_Pointer={7:0}, var_1_6={8:0}, var_1_6_Pointer={8:0}, var_1_7={9:0}, var_1_7_Pointer={9:0}, var_1_8={10:0}, var_1_8_Pointer={10:0}, var_1_9={11:0}, var_1_9_Pointer={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 3022 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1917 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1105 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=5, InterpolantAutomatonStates: 24, 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, 6 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 909 ConstructedInterpolants, 0 QuantifiedInterpolants, 1164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 629 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 2522/2548 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:26:35,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:26:37,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:26:37,383 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:26:37,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:26:37,390 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:26:37,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:26:37,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:26:37,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:26:37,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:26:37,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:26:37,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:26:37,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:26:37,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:26:37,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:26:37,413 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:26:37,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:26:37,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:26:37,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:26:37,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:26:37,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:26:37,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:26:37,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:26:37,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:26:37,414 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:26:37,414 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:26:37,414 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:26:37,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:26:37,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:26:37,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:26:37,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:26:37,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:26:37,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:26:37,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:26:37,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:26:37,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:26:37,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:26:37,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:26:37,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:26:37,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:26:37,416 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:26:37,416 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:26:37,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:26:37,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:26:37,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:26:37,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:26:37,417 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0d9ba7b8de4794ff5127bd37e96765671fd57e5f618f17f55c89012f3aab4e0 [2025-03-04 01:26:37,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:26:37,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:26:37,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:26:37,661 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:26:37,662 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:26:37,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2025-03-04 01:26:38,826 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/172727be4/6cd531e0a5aa47ff924cfcc30a09eaba/FLAG2aae10de3 [2025-03-04 01:26:39,027 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:26:39,029 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i [2025-03-04 01:26:39,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/172727be4/6cd531e0a5aa47ff924cfcc30a09eaba/FLAG2aae10de3 [2025-03-04 01:26:39,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/172727be4/6cd531e0a5aa47ff924cfcc30a09eaba [2025-03-04 01:26:39,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:26:39,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:26:39,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:26:39,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:26:39,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:26:39,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2fc184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39, skipping insertion in model container [2025-03-04 01:26:39,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:26:39,183 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i[916,929] [2025-03-04 01:26:39,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:26:39,249 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:26:39,260 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-28.i[916,929] [2025-03-04 01:26:39,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:26:39,300 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:26:39,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39 WrapperNode [2025-03-04 01:26:39,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:26:39,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:26:39,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:26:39,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:26:39,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,347 INFO L138 Inliner]: procedures = 36, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 591 [2025-03-04 01:26:39,348 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:26:39,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:26:39,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:26:39,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:26:39,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,390 INFO L175 MemorySlicer]: Split 152 memory accesses to 16 slices as follows [2, 5, 8, 8, 22, 20, 12, 5, 14, 14, 3, 5, 8, 6, 3, 17]. 14 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1]. [2025-03-04 01:26:39,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,411 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:26:39,425 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:26:39,425 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:26:39,425 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:26:39,426 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (1/1) ... [2025-03-04 01:26:39,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:26:39,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:26:39,453 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:26:39,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:26:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:26:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:26:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:26:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:26:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:26:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:26:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:26:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:26:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-04 01:26:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-04 01:26:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-04 01:26:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-04 01:26:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-04 01:26:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-04 01:26:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-04 01:26:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-03-04 01:26:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-03-04 01:26:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:26:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:26:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:26:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:26:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:26:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:26:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 01:26:39,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-04 01:26:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-04 01:26:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-04 01:26:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-04 01:26:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2025-03-04 01:26:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2025-03-04 01:26:39,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-03-04 01:26:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:26:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:26:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:26:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:26:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:26:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:26:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-04 01:26:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-04 01:26:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-03-04 01:26:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-03-04 01:26:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-03-04 01:26:39,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:26:39,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:26:39,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2025-03-04 01:26:39,482 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:26:39,483 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:26:39,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-03-04 01:26:39,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-03-04 01:26:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2025-03-04 01:26:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2025-03-04 01:26:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2025-03-04 01:26:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2025-03-04 01:26:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-03-04 01:26:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2025-03-04 01:26:39,698 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:26:39,699 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:26:40,293 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite113#1;havoc property_#t~mem110#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite109#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~mem114#1;havoc property_#t~ite121#1;havoc property_#t~mem120#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~short122#1;havoc property_#t~mem128#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~short129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~ite157#1;havoc property_#t~mem148#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem137#1;havoc property_#t~ite142#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~mem147#1;havoc property_#t~mem143#1;havoc property_#t~ite146#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~ite153#1;havoc property_#t~mem151#1;havoc property_#t~mem152#1;havoc property_#t~mem154#1;havoc property_#t~short158#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1; [2025-03-04 01:26:40,333 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-03-04 01:26:40,333 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:26:40,342 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:26:40,343 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:26:40,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:26:40 BoogieIcfgContainer [2025-03-04 01:26:40,343 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:26:40,344 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:26:40,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:26:40,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:26:40,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:26:39" (1/3) ... [2025-03-04 01:26:40,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dedc96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:26:40, skipping insertion in model container [2025-03-04 01:26:40,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:26:39" (2/3) ... [2025-03-04 01:26:40,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63dedc96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:26:40, skipping insertion in model container [2025-03-04 01:26:40,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:26:40" (3/3) ... [2025-03-04 01:26:40,351 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-28.i [2025-03-04 01:26:40,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:26:40,361 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-28.i that has 2 procedures, 114 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:26:40,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:26:40,414 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;@5b7dc0bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:26:40,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:26:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:26:40,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:40,424 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:40,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:40,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:40,427 INFO L85 PathProgramCache]: Analyzing trace with hash 509694399, now seen corresponding path program 1 times [2025-03-04 01:26:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:40,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830396441] [2025-03-04 01:26:40,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:40,435 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:40,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:40,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:40,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:26:40,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:26:40,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:26:40,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:40,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:40,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:26:40,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-03-04 01:26:40,896 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:40,896 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:40,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830396441] [2025-03-04 01:26:40,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830396441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:40,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:40,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:26:40,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510317754] [2025-03-04 01:26:40,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:26:40,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:40,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:26:40,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:26:40,918 INFO L87 Difference]: Start difference. First operand has 114 states, 97 states have (on average 1.422680412371134) internal successors, (138), 98 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:26:40,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:40,940 INFO L93 Difference]: Finished difference Result 222 states and 341 transitions. [2025-03-04 01:26:40,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:26:40,941 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2025-03-04 01:26:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:40,945 INFO L225 Difference]: With dead ends: 222 [2025-03-04 01:26:40,945 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 01:26:40,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:26:40,950 INFO L435 NwaCegarLoop]: 161 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, 161 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:40,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:26:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 01:26:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 01:26:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2025-03-04 01:26:40,986 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 128 [2025-03-04 01:26:40,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:40,987 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2025-03-04 01:26:40,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:26:40,987 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2025-03-04 01:26:40,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:26:40,993 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:40,994 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:41,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:26:41,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:41,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:41,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1124142263, now seen corresponding path program 1 times [2025-03-04 01:26:41,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:41,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1794212078] [2025-03-04 01:26:41,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:41,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:41,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:41,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:41,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:26:41,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:26:41,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:26:41,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:41,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:41,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:26:41,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:42,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-04 01:26:42,076 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 01:26:42,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:42,319 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-04 01:26:42,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-03-04 01:26:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:26:42,414 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:42,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1794212078] [2025-03-04 01:26:42,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1794212078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:26:42,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:26:42,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2025-03-04 01:26:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208138315] [2025-03-04 01:26:42,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:26:42,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:26:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:42,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:26:42,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:26:42,416 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 13 states, 11 states have (on average 8.363636363636363) internal successors, (92), 13 states have internal predecessors, (92), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2025-03-04 01:26:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:43,018 INFO L93 Difference]: Finished difference Result 223 states and 322 transitions. [2025-03-04 01:26:43,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:26:43,018 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.363636363636363) internal successors, (92), 13 states have internal predecessors, (92), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) Word has length 128 [2025-03-04 01:26:43,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:43,019 INFO L225 Difference]: With dead ends: 223 [2025-03-04 01:26:43,019 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:26:43,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:26:43,020 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 448 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:43,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 709 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:26:43,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:26:43,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-04 01:26:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 98 states have internal predecessors, (135), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2025-03-04 01:26:43,030 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 128 [2025-03-04 01:26:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:43,030 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2025-03-04 01:26:43,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.363636363636363) internal successors, (92), 13 states have internal predecessors, (92), 5 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 3 states have call predecessors, (28), 5 states have call successors, (28) [2025-03-04 01:26:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2025-03-04 01:26:43,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:26:43,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:43,033 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:43,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:26:43,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:43,234 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:43,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:43,234 INFO L85 PathProgramCache]: Analyzing trace with hash -646434901, now seen corresponding path program 1 times [2025-03-04 01:26:43,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:43,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382064070] [2025-03-04 01:26:43,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:43,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:43,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:43,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:43,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:26:43,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:26:43,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:26:43,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:43,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:43,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:26:43,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:43,613 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:26:43,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:43,614 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:43,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382064070] [2025-03-04 01:26:43,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382064070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:43,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:43,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:26:43,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403194041] [2025-03-04 01:26:43,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:43,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:26:43,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:43,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:26:43,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:26:43,615 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:43,666 INFO L93 Difference]: Finished difference Result 234 states and 333 transitions. [2025-03-04 01:26:43,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:26:43,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-03-04 01:26:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:43,669 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:26:43,669 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:26:43,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 125 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-03-04 01:26:43,670 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:43,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 744 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:26:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:26:43,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-04 01:26:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 104 states have internal predecessors, (141), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 169 transitions. [2025-03-04 01:26:43,682 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 169 transitions. Word has length 130 [2025-03-04 01:26:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:43,682 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 169 transitions. [2025-03-04 01:26:43,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 169 transitions. [2025-03-04 01:26:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:26:43,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:43,683 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:43,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:26:43,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:43,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:43,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:43,884 INFO L85 PathProgramCache]: Analyzing trace with hash 241068780, now seen corresponding path program 1 times [2025-03-04 01:26:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:43,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470395357] [2025-03-04 01:26:43,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:43,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:43,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:43,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:43,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:26:44,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:26:44,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:26:44,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:44,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:44,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:26:44,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:26:44,279 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:44,279 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:44,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470395357] [2025-03-04 01:26:44,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470395357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:44,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:44,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:26:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5233125] [2025-03-04 01:26:44,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:44,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:26:44,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:44,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:26:44,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:26:44,280 INFO L87 Difference]: Start difference. First operand 121 states and 169 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:44,344 INFO L93 Difference]: Finished difference Result 242 states and 339 transitions. [2025-03-04 01:26:44,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:26:44,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-03-04 01:26:44,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:44,347 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:26:44,348 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 01:26:44,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 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-03-04 01:26:44,349 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:44,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 886 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:26:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 01:26:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-03-04 01:26:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.349056603773585) internal successors, (143), 106 states have internal predecessors, (143), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 171 transitions. [2025-03-04 01:26:44,362 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 171 transitions. Word has length 130 [2025-03-04 01:26:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:44,362 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 171 transitions. [2025-03-04 01:26:44,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 171 transitions. [2025-03-04 01:26:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:26:44,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:44,365 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:44,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:26:44,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:44,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:44,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:44,569 INFO L85 PathProgramCache]: Analyzing trace with hash 241992301, now seen corresponding path program 1 times [2025-03-04 01:26:44,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:44,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524270278] [2025-03-04 01:26:44,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:44,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:44,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:44,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:44,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:26:44,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:26:44,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:26:44,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:44,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:44,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:26:44,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:44,952 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-03-04 01:26:44,968 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:26:44,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:44,968 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:44,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524270278] [2025-03-04 01:26:44,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524270278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:44,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:44,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:26:44,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004533438] [2025-03-04 01:26:44,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:44,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:26:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:44,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:26:44,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:26:44,970 INFO L87 Difference]: Start difference. First operand 123 states and 171 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:45,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:45,417 INFO L93 Difference]: Finished difference Result 244 states and 340 transitions. [2025-03-04 01:26:45,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:26:45,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 130 [2025-03-04 01:26:45,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:45,420 INFO L225 Difference]: With dead ends: 244 [2025-03-04 01:26:45,420 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 01:26:45,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 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-03-04 01:26:45,421 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 155 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:45,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 515 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:26:45,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 01:26:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-03-04 01:26:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.3396226415094339) internal successors, (142), 106 states have internal predecessors, (142), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 170 transitions. [2025-03-04 01:26:45,429 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 170 transitions. Word has length 130 [2025-03-04 01:26:45,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:45,429 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 170 transitions. [2025-03-04 01:26:45,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:45,431 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 170 transitions. [2025-03-04 01:26:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:26:45,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:45,433 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:45,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:26:45,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:45,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:45,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1498047638, now seen corresponding path program 1 times [2025-03-04 01:26:45,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:45,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912106414] [2025-03-04 01:26:45,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:45,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:45,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:45,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:45,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:26:45,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:26:45,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:26:45,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:45,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:45,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:26:45,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:26:45,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:45,972 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912106414] [2025-03-04 01:26:45,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912106414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:45,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:45,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:26:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297047642] [2025-03-04 01:26:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:45,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:26:45,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:45,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:26:45,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:26:45,973 INFO L87 Difference]: Start difference. First operand 123 states and 170 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:26:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:46,060 INFO L93 Difference]: Finished difference Result 245 states and 340 transitions. [2025-03-04 01:26:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:26:46,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-04 01:26:46,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:46,061 INFO L225 Difference]: With dead ends: 245 [2025-03-04 01:26:46,061 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:26:46,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 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-03-04 01:26:46,062 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:46,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:26:46,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:26:46,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-03-04 01:26:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.330188679245283) internal successors, (141), 106 states have internal predecessors, (141), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:46,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 169 transitions. [2025-03-04 01:26:46,068 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 169 transitions. Word has length 132 [2025-03-04 01:26:46,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:46,068 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 169 transitions. [2025-03-04 01:26:46,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:26:46,068 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 169 transitions. [2025-03-04 01:26:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:26:46,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:46,069 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:46,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2025-03-04 01:26:46,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:46,269 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:46,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:46,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1971566581, now seen corresponding path program 1 times [2025-03-04 01:26:46,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:46,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846076225] [2025-03-04 01:26:46,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:46,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:46,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:46,272 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:46,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:26:46,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:26:46,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:26:46,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:46,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:46,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:26:46,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:46,677 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-03-04 01:26:46,692 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 01:26:46,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:26:46,692 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:46,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846076225] [2025-03-04 01:26:46,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846076225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:26:46,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:26:46,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:26:46,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840647688] [2025-03-04 01:26:46,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:46,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:26:46,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:46,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:26:46,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:26:46,693 INFO L87 Difference]: Start difference. First operand 123 states and 169 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:26:47,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:47,114 INFO L93 Difference]: Finished difference Result 244 states and 336 transitions. [2025-03-04 01:26:47,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:26:47,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-04 01:26:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:47,117 INFO L225 Difference]: With dead ends: 244 [2025-03-04 01:26:47,117 INFO L226 Difference]: Without dead ends: 124 [2025-03-04 01:26:47,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 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-03-04 01:26:47,118 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 142 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:47,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 505 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:26:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-04 01:26:47,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-03-04 01:26:47,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 106 states have (on average 1.320754716981132) internal successors, (140), 106 states have internal predecessors, (140), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:26:47,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 168 transitions. [2025-03-04 01:26:47,126 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 168 transitions. Word has length 132 [2025-03-04 01:26:47,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:47,126 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 168 transitions. [2025-03-04 01:26:47,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:26:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 168 transitions. [2025-03-04 01:26:47,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:26:47,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:47,127 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:47,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:26:47,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:47,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:47,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:47,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1593858579, now seen corresponding path program 1 times [2025-03-04 01:26:47,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:47,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280227789] [2025-03-04 01:26:47,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:47,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:47,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:47,330 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:47,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:26:47,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:26:47,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:26:47,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:47,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:47,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:26:47,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:47,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-04 01:26:47,968 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-03-04 01:26:47,970 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-03-04 01:26:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 11 proven. 129 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-04 01:26:48,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:26:48,087 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:48,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280227789] [2025-03-04 01:26:48,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280227789] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:48,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:26:48,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-04 01:26:48,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677466357] [2025-03-04 01:26:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:48,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:26:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:48,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:26:48,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:26:48,088 INFO L87 Difference]: Start difference. First operand 123 states and 168 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:48,514 INFO L93 Difference]: Finished difference Result 317 states and 432 transitions. [2025-03-04 01:26:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:26:48,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 134 [2025-03-04 01:26:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:48,516 INFO L225 Difference]: With dead ends: 317 [2025-03-04 01:26:48,516 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 01:26:48,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:26:48,517 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 83 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:48,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 656 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:26:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 01:26:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2025-03-04 01:26:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.3333333333333333) internal successors, (232), 175 states have internal predecessors, (232), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:26:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 264 transitions. [2025-03-04 01:26:48,524 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 264 transitions. Word has length 134 [2025-03-04 01:26:48,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:48,524 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 264 transitions. [2025-03-04 01:26:48,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:48,524 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 264 transitions. [2025-03-04 01:26:48,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:26:48,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:48,525 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:48,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:26:48,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:48,726 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:48,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:48,726 INFO L85 PathProgramCache]: Analyzing trace with hash -519013585, now seen corresponding path program 1 times [2025-03-04 01:26:48,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:48,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115231199] [2025-03-04 01:26:48,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:48,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:48,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:48,728 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:48,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:26:48,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:26:49,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:26:49,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:26:49,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:26:49,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:26:49,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:26:49,373 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 28 treesize of output 20 [2025-03-04 01:26:49,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 14 treesize of output 10 [2025-03-04 01:26:49,423 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-03-04 01:26:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 187 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-04 01:26:49,449 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:26:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:26:49,511 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:26:49,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115231199] [2025-03-04 01:26:49,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115231199] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:26:49,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:26:49,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-04 01:26:49,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041703250] [2025-03-04 01:26:49,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:26:49,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:26:49,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:26:49,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:26:49,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:26:49,512 INFO L87 Difference]: Start difference. First operand 194 states and 264 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:49,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:26:49,528 INFO L93 Difference]: Finished difference Result 385 states and 525 transitions. [2025-03-04 01:26:49,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:26:49,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 136 [2025-03-04 01:26:49,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:26:49,530 INFO L225 Difference]: With dead ends: 385 [2025-03-04 01:26:49,530 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 01:26:49,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:26:49,531 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:26:49,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 306 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:26:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 01:26:49,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-04 01:26:49,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.3218390804597702) internal successors, (230), 175 states have internal predecessors, (230), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:26:49,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 262 transitions. [2025-03-04 01:26:49,537 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 262 transitions. Word has length 136 [2025-03-04 01:26:49,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:26:49,538 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 262 transitions. [2025-03-04 01:26:49,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:26:49,538 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 262 transitions. [2025-03-04 01:26:49,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:26:49,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:26:49,539 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:26:49,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:26:49,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:49,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:26:49,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:26:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1516085938, now seen corresponding path program 1 times [2025-03-04 01:26:49,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:26:49,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968542185] [2025-03-04 01:26:49,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:26:49,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:26:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:26:49,742 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:26:49,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:26:49,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:27:08,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:27:08,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:27:08,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:27:08,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 01:27:08,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:27:12,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 34 [2025-03-04 01:27:12,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:27:21,051 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 129 treesize of output 81 [2025-03-04 01:27:21,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 69 [2025-03-04 01:27:21,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 50 [2025-03-04 01:27:23,826 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 6 proven. 238 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:27:23,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:27:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:27:38,334 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:27:38,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968542185] [2025-03-04 01:27:38,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968542185] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:27:38,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:27:38,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [27] total 31 [2025-03-04 01:27:38,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261894105] [2025-03-04 01:27:38,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:27:38,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:27:38,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:27:38,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:27:38,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=846, Unknown=0, NotChecked=0, Total=930 [2025-03-04 01:27:38,336 INFO L87 Difference]: Start difference. First operand 194 states and 262 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:27:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:27:53,025 INFO L93 Difference]: Finished difference Result 387 states and 522 transitions. [2025-03-04 01:27:53,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:27:53,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 136 [2025-03-04 01:27:53,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:27:53,034 INFO L225 Difference]: With dead ends: 387 [2025-03-04 01:27:53,034 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 01:27:53,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2025-03-04 01:27:53,035 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 61 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:27:53,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 653 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2025-03-04 01:27:53,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 01:27:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2025-03-04 01:27:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.3160919540229885) internal successors, (229), 175 states have internal predecessors, (229), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 01:27:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 261 transitions. [2025-03-04 01:27:53,045 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 261 transitions. Word has length 136 [2025-03-04 01:27:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:27:53,045 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 261 transitions. [2025-03-04 01:27:53,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:27:53,046 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 261 transitions. [2025-03-04 01:27:53,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:27:53,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:27:53,047 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:27:53,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-04 01:27:53,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:27:53,247 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:27:53,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:27:53,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1503081866, now seen corresponding path program 1 times [2025-03-04 01:27:53,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:27:53,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994395372] [2025-03-04 01:27:53,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:27:53,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:27:53,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:27:53,250 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:27:53,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-04 01:27:53,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:28:08,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:28:08,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:28:08,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:28:08,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 01:28:08,690 INFO L279 TraceCheckSpWp]: Computing forward predicates...