./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.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 abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:20:41,308 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:20:41,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:20:41,368 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:20:41,368 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:20:41,390 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:20:41,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:20:41,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:20:41,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:20:41,391 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:20:41,392 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:20:41,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:20:41,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:20:41,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:20:41,393 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:20:41,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:20:41,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:20:41,393 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:20:41,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:20:41,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:20:41,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:20:41,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:20:41,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:20:41,395 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:20:41,395 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:20:41,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:20:41,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:20:41,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:20:41,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:20:41,396 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:20:41,396 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:20:41,396 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:20:41,396 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:20:41,396 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 -> abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 [2025-03-17 05:20:41,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:20:41,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:20:41,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:20:41,659 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:20:41,659 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:20:41,660 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2025-03-17 05:20:42,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f63f242a/fdc578aaeef54ef99c50470feef132e6/FLAG452ce7fb6 [2025-03-17 05:20:43,216 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:20:43,216 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2025-03-17 05:20:43,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f63f242a/fdc578aaeef54ef99c50470feef132e6/FLAG452ce7fb6 [2025-03-17 05:20:43,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f63f242a/fdc578aaeef54ef99c50470feef132e6 [2025-03-17 05:20:43,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:20:43,263 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:20:43,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:20:43,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:20:43,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:20:43,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9801bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43, skipping insertion in model container [2025-03-17 05:20:43,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,294 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:20:43,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i[916,929] [2025-03-17 05:20:43,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:20:43,472 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:20:43,483 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i[916,929] [2025-03-17 05:20:43,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:20:43,534 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:20:43,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43 WrapperNode [2025-03-17 05:20:43,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:20:43,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:20:43,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:20:43,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:20:43,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,556 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,586 INFO L138 Inliner]: procedures = 29, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-03-17 05:20:43,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:20:43,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:20:43,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:20:43,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:20:43,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,635 INFO L175 MemorySlicer]: Split 136 memory accesses to 6 slices as follows [2, 14, 13, 45, 33, 29]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 5, 3, 4]. The 20 writes are split as follows [0, 2, 2, 6, 5, 5]. [2025-03-17 05:20:43,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,657 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,663 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:20:43,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:20:43,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:20:43,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:20:43,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (1/1) ... [2025-03-17 05:20:43,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:20:43,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:43,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:20:43,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:20:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:20:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:20:43,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:20:43,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:20:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:20:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:20:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:20:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:20:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:20:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:20:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:20:43,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:20:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:20:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:20:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:20:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:20:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:20:43,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:20:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:20:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:20:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:20:43,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:20:43,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:20:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:20:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:20:43,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:20:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:20:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:20:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:20:43,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:20:43,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:20:43,856 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:20:43,857 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:20:44,208 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem95#1;havoc property_#t~ite103#1;havoc property_#t~mem99#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem107#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~short111#1;havoc property_#t~ite122#1;havoc property_#t~mem115#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite139#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short141#1; [2025-03-17 05:20:44,242 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-17 05:20:44,242 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:20:44,252 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:20:44,253 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:20:44,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:44 BoogieIcfgContainer [2025-03-17 05:20:44,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:20:44,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:20:44,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:20:44,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:20:44,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:20:43" (1/3) ... [2025-03-17 05:20:44,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8269e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:20:44, skipping insertion in model container [2025-03-17 05:20:44,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:43" (2/3) ... [2025-03-17 05:20:44,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8269e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:20:44, skipping insertion in model container [2025-03-17 05:20:44,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:44" (3/3) ... [2025-03-17 05:20:44,263 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-20.i [2025-03-17 05:20:44,278 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:20:44,280 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-20.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:20:44,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:20:44,346 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;@55c0b480, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:20:44,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:20:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:20:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:20:44,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:44,365 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:44,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:44,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:44,372 INFO L85 PathProgramCache]: Analyzing trace with hash -834319551, now seen corresponding path program 1 times [2025-03-17 05:20:44,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:44,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194326744] [2025-03-17 05:20:44,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:44,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:44,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:20:44,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:20:44,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:44,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:20:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:20:44,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194326744] [2025-03-17 05:20:44,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194326744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:20:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803168731] [2025-03-17 05:20:44,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:44,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:20:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:44,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:20:44,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:20:44,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:20:44,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:20:44,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:44,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:20:44,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:20:44,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:20:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-17 05:20:44,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:20:44,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803168731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:20:44,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:20:44,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:20:44,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942298019] [2025-03-17 05:20:44,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:20:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:20:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:20:45,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:20:45,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:20:45,009 INFO L87 Difference]: Start difference. First operand has 107 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:20:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:20:45,031 INFO L93 Difference]: Finished difference Result 211 states and 337 transitions. [2025-03-17 05:20:45,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:20:45,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2025-03-17 05:20:45,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:20:45,038 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:20:45,038 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:20:45,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:20:45,043 INFO L435 NwaCegarLoop]: 152 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, 152 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:20:45,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:20:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:20:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 05:20:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:20:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2025-03-17 05:20:45,080 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 148 [2025-03-17 05:20:45,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:20:45,082 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2025-03-17 05:20:45,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:20:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2025-03-17 05:20:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:20:45,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:20:45,086 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:20:45,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:20:45,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:20:45,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:20:45,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:20:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash 110533448, now seen corresponding path program 1 times [2025-03-17 05:20:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:20:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464548362] [2025-03-17 05:20:45,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:20:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:20:45,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:20:45,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:20:45,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:45,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:20:45,488 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:20:45,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:20:45,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:20:45,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:20:45,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:20:45,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:20:45,728 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:20:45,730 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:20:45,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:20:45,736 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 05:20:45,811 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:20:45,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:20:45 BoogieIcfgContainer [2025-03-17 05:20:45,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:20:45,815 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:20:45,815 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:20:45,815 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:20:45,816 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:20:44" (3/4) ... [2025-03-17 05:20:45,818 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:20:45,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:20:45,819 INFO L158 Benchmark]: Toolchain (without parser) took 2559.77ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 117.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2025-03-17 05:20:45,819 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:20:45,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.08ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 106.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:20:45,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.01ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:20:45,820 INFO L158 Benchmark]: Boogie Preprocessor took 86.85ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 98.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:20:45,820 INFO L158 Benchmark]: IcfgBuilder took 577.76ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 67.0MB in the end (delta: 31.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 05:20:45,820 INFO L158 Benchmark]: TraceAbstraction took 1557.86ms. Allocated memory is still 167.8MB. Free memory was 66.1MB in the beginning and 117.3MB in the end (delta: -51.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2025-03-17 05:20:45,820 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 117.3MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:20:45,829 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.22ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.08ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 106.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.01ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.1MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 86.85ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 98.8MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 577.76ms. Allocated memory is still 167.8MB. Free memory was 98.8MB in the beginning and 67.0MB in the end (delta: 31.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1557.86ms. Allocated memory is still 167.8MB. Free memory was 66.1MB in the beginning and 117.3MB in the end (delta: -51.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 167.8MB. Free memory was 117.3MB in the beginning and 117.3MB in the end (delta: 41.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 45, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryArithmeticFLOAToperation at line 41. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L25-L27] double double_Array_0[2] = { 4.6, 10.2 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L28-L30] float float_Array_0[5] = { 999999999999.4, 8.5, 2.95, 0.0, 0.6 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 100, 1, 128 }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L34-L36] unsigned long int unsigned_long_int_Array_0[2][2] = { {25, 256}, {1, 3724367395} }; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L67] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L70] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L73] double_Array_0[0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L74] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L75] float_Array_0[0] = __VERIFIER_nondet_float() [L76] EXPR float_Array_0[0] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F [L76] EXPR float_Array_0[0] [L76] EXPR float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] EXPR (float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] CALL assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L76] RET assume_abort_if_not((float_Array_0[0] >= -461168.6018427382800e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L77] float_Array_0[1] = __VERIFIER_nondet_float() [L78] EXPR float_Array_0[1] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F [L78] EXPR float_Array_0[1] [L78] EXPR float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] EXPR (float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] CALL assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L78] RET assume_abort_if_not((float_Array_0[1] >= 0.0F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L79] float_Array_0[2] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[2] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F [L80] EXPR float_Array_0[2] [L80] EXPR float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] EXPR (float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] CALL assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L80] RET assume_abort_if_not((float_Array_0[2] >= 0.0F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L81] float_Array_0[3] = __VERIFIER_nondet_float() [L82] EXPR float_Array_0[3] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F [L82] EXPR float_Array_0[3] [L82] EXPR float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] EXPR (float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] CALL assume_abort_if_not((float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L82] RET assume_abort_if_not((float_Array_0[3] >= 4611686.018427382800e+12F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 9223372.036854765600e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L83] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L84] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L86] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L87] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L88] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L89] unsigned_long_int_Array_0[0][0] = __VERIFIER_nondet_ulong() [L90] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] EXPR unsigned_long_int_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] CALL assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L91] RET assume_abort_if_not(unsigned_long_int_Array_0[0][0] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L92] unsigned_long_int_Array_0[1][0] = __VERIFIER_nondet_ulong() [L93] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] EXPR unsigned_long_int_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L94] RET assume_abort_if_not(unsigned_long_int_Array_0[1][0] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L95] unsigned_long_int_Array_0[1][1] = __VERIFIER_nondet_ulong() [L96] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 3221225470) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L96] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] >= 3221225470) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] CALL assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L97] RET assume_abort_if_not(unsigned_long_int_Array_0[1][1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L110] RET updateVariables() [L111] CALL step() [L40] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L40] COND TRUE BOOL_unsigned_char_Array_0[1] [L41] EXPR float_Array_0[3] [L41] EXPR float_Array_0[2] [L41] EXPR float_Array_0[1] [L41] float_Array_0[4] = ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]) [L45] EXPR float_Array_0[2] [L45] EXPR float_Array_0[3] [L45] EXPR double_Array_0[0] [L45] double_Array_0[1] = ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])) [L46] EXPR unsigned_long_int_Array_0[1][0] [L46] unsigned long int stepLocal_2 = unsigned_long_int_Array_0[1][0]; [L47] signed long int stepLocal_1 = 5; [L48] EXPR unsigned_long_int_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L48] COND FALSE !(stepLocal_1 >= unsigned_long_int_Array_0[1][1]) [L59] EXPR BOOL_unsigned_char_Array_0[1] [L59] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[1]; [L60] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L60] COND TRUE BOOL_unsigned_char_Array_0[0] || stepLocal_0 [L61] EXPR unsigned_long_int_Array_0[1][1] [L61] EXPR unsigned_char_Array_0[1] [L61] EXPR unsigned_char_Array_0[1] [L61] unsigned_long_int_Array_0[0][1] = ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]) [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0]))) [L102] EXPR float_Array_0[4] [L102] EXPR float_Array_0[3] [L102] EXPR float_Array_0[2] [L102] EXPR float_Array_0[1] [L102] EXPR BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) [L102] EXPR double_Array_0[1] [L102] EXPR float_Array_0[2] [L102] EXPR float_Array_0[3] [L102] EXPR double_Array_0[0] [L102] EXPR (BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR ((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR ((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1]))))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102] EXPR (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L102-L103] return (((BOOL_unsigned_char_Array_0[1] ? (float_Array_0[4] == ((float) ((float_Array_0[3] - float_Array_0[2]) - float_Array_0[1]))) : (float_Array_0[4] == ((float) (float_Array_0[2] + float_Array_0[0])))) && (double_Array_0[1] == ((double) ((15.5 + float_Array_0[2]) - (float_Array_0[3] - double_Array_0[0]))))) && ((BOOL_unsigned_char_Array_0[0] || BOOL_unsigned_char_Array_0[1]) ? (unsigned_long_int_Array_0[0][1] == ((unsigned long int) ((unsigned_long_int_Array_0[1][1] - unsigned_char_Array_0[1]) - unsigned_char_Array_0[1]))) : (unsigned_long_int_Array_0[0][1] == ((unsigned long int) (unsigned_char_Array_0[1] + ((((unsigned_char_Array_0[1]) < 0 ) ? -(unsigned_char_Array_0[1]) : (unsigned_char_Array_0[1])))))))) && ((5 >= unsigned_long_int_Array_0[1][1]) ? ((float_Array_0[4] >= double_Array_0[0]) ? (unsigned_char_Array_0[1] == ((unsigned char) (128 - 16))) : ((unsigned_long_int_Array_0[1][0] >= ((((unsigned_long_int_Array_0[0][0]) < 0 ) ? -(unsigned_long_int_Array_0[0][0]) : (unsigned_long_int_Array_0[0][0])))) ? (unsigned_char_Array_0[1] == ((unsigned char) (unsigned_char_Array_0[2] - unsigned_char_Array_0[0]))) : (unsigned_char_Array_0[1] == ((unsigned char) unsigned_char_Array_0[0])))) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, unsigned_char_Array_0={7:0}, unsigned_long_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 179 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 152 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 294 SizeOfPredicates, 0 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 1332/1368 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:20:45,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.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 abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:20:48,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:20:48,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:20:48,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:20:48,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:20:48,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:20:48,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:20:48,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:20:48,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:20:48,211 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:20:48,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:20:48,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:20:48,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:20:48,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:20:48,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:20:48,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:20:48,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:20:48,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:20:48,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:20:48,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:20:48,215 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:20:48,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:20:48,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:20:48,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:20:48,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:20:48,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:20:48,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:20:48,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:20:48,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:20:48,216 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:20:48,216 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:20:48,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:20:48,216 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:20:48,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:20:48,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:20:48,216 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 -> abbff6ecf7c52e46d71543d2bdba93ca4d1ac478e10fca6c71bd3d1c9baf5e12 [2025-03-17 05:20:48,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:20:48,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:20:48,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:20:48,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:20:48,502 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:20:48,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2025-03-17 05:20:49,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48e6eacf/e2818e8e4f934a4584184fb65ff0dd78/FLAG765690053 [2025-03-17 05:20:50,008 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:20:50,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i [2025-03-17 05:20:50,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48e6eacf/e2818e8e4f934a4584184fb65ff0dd78/FLAG765690053 [2025-03-17 05:20:50,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b48e6eacf/e2818e8e4f934a4584184fb65ff0dd78 [2025-03-17 05:20:50,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:20:50,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:20:50,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:20:50,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:20:50,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:20:50,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a487a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50, skipping insertion in model container [2025-03-17 05:20:50,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:20:50,220 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i[916,929] [2025-03-17 05:20:50,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:20:50,304 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:20:50,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-20.i[916,929] [2025-03-17 05:20:50,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:20:50,383 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:20:50,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50 WrapperNode [2025-03-17 05:20:50,385 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:20:50,386 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:20:50,386 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:20:50,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:20:50,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,410 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,446 INFO L138 Inliner]: procedures = 36, calls = 171, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-03-17 05:20:50,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:20:50,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:20:50,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:20:50,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:20:50,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,495 INFO L175 MemorySlicer]: Split 136 memory accesses to 6 slices as follows [2, 14, 13, 45, 33, 29]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 2, 2, 5, 3, 4]. The 20 writes are split as follows [0, 2, 2, 6, 5, 5]. [2025-03-17 05:20:50,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:20:50,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:20:50,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:20:50,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:20:50,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (1/1) ... [2025-03-17 05:20:50,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:20:50,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:20:50,565 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:20:50,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:20:50,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:20:50,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:20:50,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:20:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:20:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:20:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:20:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:20:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:20:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:20:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:20:50,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:20:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:20:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:20:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:20:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:20:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:20:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:20:50,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:20:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:20:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:20:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:20:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:20:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:20:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:20:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:20:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:20:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:20:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:20:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:20:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:20:50,742 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:20:50,744 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:21:00,885 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L102: havoc property_#t~mem95#1;havoc property_#t~ite103#1;havoc property_#t~mem99#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem107#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~short111#1;havoc property_#t~ite122#1;havoc property_#t~mem115#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem116#1;havoc property_#t~ite119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~ite140#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite139#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short141#1; [2025-03-17 05:21:00,919 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2025-03-17 05:21:00,919 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:21:00,930 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:21:00,931 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:21:00,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:00 BoogieIcfgContainer [2025-03-17 05:21:00,931 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:21:00,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:21:00,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:21:00,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:21:00,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:20:50" (1/3) ... [2025-03-17 05:21:00,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747a04c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:00, skipping insertion in model container [2025-03-17 05:21:00,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:20:50" (2/3) ... [2025-03-17 05:21:00,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747a04c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:21:00, skipping insertion in model container [2025-03-17 05:21:00,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:21:00" (3/3) ... [2025-03-17 05:21:00,940 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-20.i [2025-03-17 05:21:00,951 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:21:00,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-20.i that has 2 procedures, 107 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:21:00,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:21:01,007 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;@4fe3a961, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:21:01,008 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:21:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:21:01,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:21:01,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:01,022 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:21:01,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:01,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash -834319551, now seen corresponding path program 1 times [2025-03-17 05:21:01,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:01,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159574341] [2025-03-17 05:21:01,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:01,038 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:01,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:01,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:21:01,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:21:01,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:21:01,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:21:01,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:01,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:01,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:21:01,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 296 proven. 0 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-17 05:21:01,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:01,834 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:01,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159574341] [2025-03-17 05:21:01,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159574341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:01,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:01,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:21:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690146077] [2025-03-17 05:21:01,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:01,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:21:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:01,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:21:01,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:21:01,855 INFO L87 Difference]: Start difference. First operand has 107 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:21:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:01,884 INFO L93 Difference]: Finished difference Result 211 states and 337 transitions. [2025-03-17 05:21:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:21:01,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2025-03-17 05:21:01,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:01,892 INFO L225 Difference]: With dead ends: 211 [2025-03-17 05:21:01,892 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 05:21:01,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:21:01,897 INFO L435 NwaCegarLoop]: 152 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, 152 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:01,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:21:01,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 05:21:01,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2025-03-17 05:21:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:21:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 152 transitions. [2025-03-17 05:21:01,932 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 152 transitions. Word has length 148 [2025-03-17 05:21:01,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:01,933 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 152 transitions. [2025-03-17 05:21:01,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:21:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 152 transitions. [2025-03-17 05:21:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 05:21:01,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:01,936 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:21:01,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:21:02,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:02,137 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:02,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:02,138 INFO L85 PathProgramCache]: Analyzing trace with hash 110533448, now seen corresponding path program 1 times [2025-03-17 05:21:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:02,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176693510] [2025-03-17 05:21:02,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:02,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:02,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:02,144 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:21:02,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:21:02,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 05:21:02,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 05:21:02,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:02,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:02,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:21:03,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:03,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:21:03,492 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 155 treesize of output 65 [2025-03-17 05:21:03,588 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-17 05:21:03,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:03,589 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:03,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176693510] [2025-03-17 05:21:03,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176693510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:03,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:03,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:03,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624041652] [2025-03-17 05:21:03,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:03,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:03,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:03,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:03,592 INFO L87 Difference]: Start difference. First operand 105 states and 152 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:21:08,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:11,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:16,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:20,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:20,507 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2025-03-17 05:21:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:21:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 148 [2025-03-17 05:21:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:20,512 INFO L225 Difference]: With dead ends: 210 [2025-03-17 05:21:20,513 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 05:21:20,513 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:20,514 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 134 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:20,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 436 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 2 Unknown, 0 Unchecked, 16.8s Time] [2025-03-17 05:21:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 05:21:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 05:21:20,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:21:20,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2025-03-17 05:21:20,527 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 148 [2025-03-17 05:21:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:20,528 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2025-03-17 05:21:20,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:21:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2025-03-17 05:21:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-17 05:21:20,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:20,529 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:21:20,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 05:21:20,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:20,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:20,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:20,731 INFO L85 PathProgramCache]: Analyzing trace with hash 302385130, now seen corresponding path program 1 times [2025-03-17 05:21:20,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:20,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259886006] [2025-03-17 05:21:20,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:20,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:20,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:20,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:21:20,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:21:20,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-17 05:21:21,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-17 05:21:21,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:21,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:21,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:21:21,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:21,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-17 05:21:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2025-03-17 05:21:22,072 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:22,072 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:22,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259886006] [2025-03-17 05:21:22,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259886006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:22,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:22,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:22,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752793695] [2025-03-17 05:21:22,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:22,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:22,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:22,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:22,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:22,073 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:21:27,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:29,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:33,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:33,954 INFO L93 Difference]: Finished difference Result 210 states and 302 transitions. [2025-03-17 05:21:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:21:33,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 150 [2025-03-17 05:21:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:33,962 INFO L225 Difference]: With dead ends: 210 [2025-03-17 05:21:33,962 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 05:21:33,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:33,963 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 120 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:33,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 427 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 1 Unknown, 0 Unchecked, 11.7s Time] [2025-03-17 05:21:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 05:21:33,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 05:21:33,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 84 states have internal predecessors, (112), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:21:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2025-03-17 05:21:33,974 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 150 [2025-03-17 05:21:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:33,975 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2025-03-17 05:21:33,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:21:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2025-03-17 05:21:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-17 05:21:33,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:33,977 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:21:34,009 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 (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:21:34,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:34,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:34,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:34,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1795175924, now seen corresponding path program 1 times [2025-03-17 05:21:34,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:34,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913830487] [2025-03-17 05:21:34,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:34,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:34,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:34,183 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:21:34,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:21:34,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-17 05:21:34,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-17 05:21:34,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:34,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:34,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:21:34,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:35,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 95 treesize of output 41 [2025-03-17 05:21:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2025-03-17 05:21:35,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:35,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913830487] [2025-03-17 05:21:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1913830487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:35,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:35,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:35,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976643921] [2025-03-17 05:21:35,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:35,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:35,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:35,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:35,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:35,504 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:21:41,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:43,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:47,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:49,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:21:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:50,127 INFO L93 Difference]: Finished difference Result 210 states and 300 transitions. [2025-03-17 05:21:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:21:50,131 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), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 152 [2025-03-17 05:21:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:50,132 INFO L225 Difference]: With dead ends: 210 [2025-03-17 05:21:50,132 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 05:21:50,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:21:50,133 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 111 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:50,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 425 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 2 Unknown, 0 Unchecked, 14.5s Time] [2025-03-17 05:21:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 05:21:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 05:21:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:21:50,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 149 transitions. [2025-03-17 05:21:50,146 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 149 transitions. Word has length 152 [2025-03-17 05:21:50,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:50,146 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 149 transitions. [2025-03-17 05:21:50,146 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), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:21:50,146 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 149 transitions. [2025-03-17 05:21:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:21:50,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:50,149 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:21:50,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:21:50,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:50,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:50,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash 676594441, now seen corresponding path program 1 times [2025-03-17 05:21:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612185117] [2025-03-17 05:21:50,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:50,351 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:50,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:50,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:21:50,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:21:50,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:21:51,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:21:51,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:51,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:51,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:21:51,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-03-17 05:21:51,252 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:51,252 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612185117] [2025-03-17 05:21:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612185117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:51,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:51,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:21:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163781655] [2025-03-17 05:21:51,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:51,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:51,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:51,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:51,254 INFO L87 Difference]: Start difference. First operand 105 states and 149 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:21:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:21:51,886 INFO L93 Difference]: Finished difference Result 213 states and 302 transitions. [2025-03-17 05:21:51,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:21:51,887 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), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 154 [2025-03-17 05:21:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:21:51,888 INFO L225 Difference]: With dead ends: 213 [2025-03-17 05:21:51,888 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 05:21:51,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:21:51,890 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:21:51,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 585 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:21:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 05:21:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2025-03-17 05:21:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:21:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2025-03-17 05:21:51,898 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 154 [2025-03-17 05:21:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:21:51,898 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2025-03-17 05:21:51,898 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), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-17 05:21:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2025-03-17 05:21:51,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-17 05:21:51,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:21:51,900 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:21:51,932 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 (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:21:52,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:52,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:21:52,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:21:52,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1486081898, now seen corresponding path program 1 times [2025-03-17 05:21:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:21:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788998137] [2025-03-17 05:21:52,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:21:52,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:21:52,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:21:52,104 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:21:52,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:21:52,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-17 05:21:52,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-17 05:21:52,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:21:52,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:21:52,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:21:52,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:21:53,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 43 [2025-03-17 05:21:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2025-03-17 05:21:53,401 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:21:53,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:21:53,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788998137] [2025-03-17 05:21:53,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788998137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:21:53,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:21:53,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:21:53,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795401557] [2025-03-17 05:21:53,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:21:53,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:21:53,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:21:53,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:21:53,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:21:53,402 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:21:58,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:01,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:06,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:08,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:11,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:22:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:22:11,821 INFO L93 Difference]: Finished difference Result 210 states and 296 transitions. [2025-03-17 05:22:11,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:22:11,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 154 [2025-03-17 05:22:11,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:22:11,829 INFO L225 Difference]: With dead ends: 210 [2025-03-17 05:22:11,829 INFO L226 Difference]: Without dead ends: 106 [2025-03-17 05:22:11,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:22:11,830 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 100 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:22:11,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 415 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 2 Unknown, 0 Unchecked, 18.3s Time] [2025-03-17 05:22:11,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-17 05:22:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-03-17 05:22:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:22:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2025-03-17 05:22:11,843 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 154 [2025-03-17 05:22:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:22:11,843 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2025-03-17 05:22:11,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-17 05:22:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2025-03-17 05:22:11,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-17 05:22:11,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:22:11,844 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:22:11,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 05:22:12,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:12,045 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:22:12,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:22:12,046 INFO L85 PathProgramCache]: Analyzing trace with hash 145721228, now seen corresponding path program 1 times [2025-03-17 05:22:12,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:22:12,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148007846] [2025-03-17 05:22:12,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:22:12,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:22:12,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:22:12,048 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:22:12,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 05:22:12,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.