./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.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-46.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 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:23:56,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:23:56,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:23:56,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:23:56,465 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:23:56,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:23:56,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:23:56,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:23:56,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:23:56,487 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:23:56,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:23:56,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:23:56,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:23:56,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:23:56,489 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:23:56,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:23:56,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:23:56,489 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:23:56,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:23:56,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:23:56,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:23:56,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:23:56,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:23:56,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:23:56,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:23:56,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:23:56,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:23:56,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:23:56,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:23:56,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:23:56,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:23:56,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:23:56,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:56,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:23:56,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:23:56,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:23:56,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:23:56,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:23:56,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:23:56,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:23:56,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:23:56,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:23:56,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:23:56,492 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 -> 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe [2025-03-17 05:23:56,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:23:56,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:23:56,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:23:56,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:23:56,796 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:23:56,798 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-46.i [2025-03-17 05:23:58,130 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b5bbfd0/73a4e0e6405a425ca0d76795208f1ba0/FLAGea14c295f [2025-03-17 05:23:58,428 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:23:58,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2025-03-17 05:23:58,442 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b5bbfd0/73a4e0e6405a425ca0d76795208f1ba0/FLAGea14c295f [2025-03-17 05:23:58,465 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b5bbfd0/73a4e0e6405a425ca0d76795208f1ba0 [2025-03-17 05:23:58,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:23:58,471 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:23:58,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:58,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:23:58,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:23:58,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1b8949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58, skipping insertion in model container [2025-03-17 05:23:58,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:23:58,628 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-46.i[916,929] [2025-03-17 05:23:58,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:58,698 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:23:58,707 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-46.i[916,929] [2025-03-17 05:23:58,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:23:58,754 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:23:58,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58 WrapperNode [2025-03-17 05:23:58,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:23:58,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:58,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:23:58,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:23:58,763 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:23:58" (1/1) ... [2025-03-17 05:23:58,781 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:23:58" (1/1) ... [2025-03-17 05:23:58,807 INFO L138 Inliner]: procedures = 29, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 399 [2025-03-17 05:23:58,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:23:58,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:23:58,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:23:58,809 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:23:58,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,820 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,841 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2025-03-17 05:23:58,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:23:58,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:23:58,865 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:23:58,865 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:23:58,866 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (1/1) ... [2025-03-17 05:23:58,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:23:58,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:58,896 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:23:58,900 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:23:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:23:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:23:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:23:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:23:58,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:23:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:23:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:23:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:23:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:23:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:23:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:23:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:23:58,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:23:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:23:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:23:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:23:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:23:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:23:58,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:23:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:23:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:23:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:23:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:23:58,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:23:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:23:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:23:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:23:58,923 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:23:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:23:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:23:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:23:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:23:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:23:58,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:23:58,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:23:59,046 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:23:59,047 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:23:59,417 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem58#1;havoc property_#t~ite80#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~ite78#1;havoc property_#t~mem62#1;havoc property_#t~mem63#1;havoc property_#t~ite66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite72#1;havoc property_#t~mem67#1;havoc property_#t~mem71#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~short70#1;havoc property_#t~mem73#1;havoc property_#t~ite77#1;havoc property_#t~mem74#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~short85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~bitwise88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~short95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~short102#1; [2025-03-17 05:23:59,453 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-17 05:23:59,454 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:23:59,471 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:23:59,472 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:23:59,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:59 BoogieIcfgContainer [2025-03-17 05:23:59,473 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:23:59,474 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:23:59,474 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:23:59,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:23:59,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:23:58" (1/3) ... [2025-03-17 05:23:59,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157ba409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:59, skipping insertion in model container [2025-03-17 05:23:59,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:23:58" (2/3) ... [2025-03-17 05:23:59,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157ba409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:23:59, skipping insertion in model container [2025-03-17 05:23:59,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:59" (3/3) ... [2025-03-17 05:23:59,480 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-46.i [2025-03-17 05:23:59,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:23:59,496 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-46.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:23:59,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:23:59,554 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;@537d26c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:23:59,555 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:23:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:23:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:23:59,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:23:59,570 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:23:59,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:23:59,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:23:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2120655049, now seen corresponding path program 1 times [2025-03-17 05:23:59,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:23:59,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702997448] [2025-03-17 05:23:59,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:23:59,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:23:59,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:23:59,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:23:59,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:23:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:23:59,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:23:59,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702997448] [2025-03-17 05:23:59,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702997448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:23:59,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893753914] [2025-03-17 05:23:59,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:23:59,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:23:59,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:23:59,845 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:23:59,846 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:23:59,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:24:00,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:24:00,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:00,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:00,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:24:00,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 05:24:00,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893753914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:00,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:24:00,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:24:00,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858705827] [2025-03-17 05:24:00,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:00,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:24:00,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:00,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:24:00,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:24:00,072 INFO L87 Difference]: Start difference. First operand has 95 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:24:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:00,098 INFO L93 Difference]: Finished difference Result 187 states and 292 transitions. [2025-03-17 05:24:00,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:24:00,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-03-17 05:24:00,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:00,106 INFO L225 Difference]: With dead ends: 187 [2025-03-17 05:24:00,107 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 05:24:00,110 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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:24:00,115 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:00,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 05:24:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 05:24:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:24:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2025-03-17 05:24:00,157 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 112 [2025-03-17 05:24:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:00,158 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2025-03-17 05:24:00,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:24:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2025-03-17 05:24:00,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:24:00,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:00,162 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:00,169 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:24:00,362 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:24:00,363 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:00,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:00,364 INFO L85 PathProgramCache]: Analyzing trace with hash -298530101, now seen corresponding path program 1 times [2025-03-17 05:24:00,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:00,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397082800] [2025-03-17 05:24:00,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:00,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:00,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:24:00,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:24:00,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:00,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:24:01,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:01,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397082800] [2025-03-17 05:24:01,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397082800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:01,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:01,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:24:01,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128858153] [2025-03-17 05:24:01,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:01,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:24:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:01,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:24:01,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:24:01,499 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:24:02,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:02,045 INFO L93 Difference]: Finished difference Result 357 states and 522 transitions. [2025-03-17 05:24:02,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:02,050 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 112 [2025-03-17 05:24:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:02,052 INFO L225 Difference]: With dead ends: 357 [2025-03-17 05:24:02,052 INFO L226 Difference]: Without dead ends: 265 [2025-03-17 05:24:02,053 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:24:02,053 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 440 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:02,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 688 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:24:02,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-17 05:24:02,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 258. [2025-03-17 05:24:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 217 states have (on average 1.4055299539170507) internal successors, (305), 218 states have internal predecessors, (305), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 05:24:02,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 379 transitions. [2025-03-17 05:24:02,091 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 379 transitions. Word has length 112 [2025-03-17 05:24:02,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:02,092 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 379 transitions. [2025-03-17 05:24:02,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 05:24:02,092 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 379 transitions. [2025-03-17 05:24:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:24:02,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:02,094 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:02,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:24:02,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:02,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -591933108, now seen corresponding path program 1 times [2025-03-17 05:24:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945241829] [2025-03-17 05:24:02,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:02,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:02,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:24:02,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:24:02,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:02,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:02,577 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:24:02,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:02,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945241829] [2025-03-17 05:24:02,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945241829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:02,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:02,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:24:02,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248252496] [2025-03-17 05:24:02,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:02,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:24:02,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:02,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:24:02,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:24:02,579 INFO L87 Difference]: Start difference. First operand 258 states and 379 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:24:02,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:02,760 INFO L93 Difference]: Finished difference Result 778 states and 1144 transitions. [2025-03-17 05:24:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:24:02,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-03-17 05:24:02,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:02,769 INFO L225 Difference]: With dead ends: 778 [2025-03-17 05:24:02,770 INFO L226 Difference]: Without dead ends: 521 [2025-03-17 05:24:02,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:24:02,774 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 121 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:02,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 502 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:24:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-17 05:24:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 294. [2025-03-17 05:24:02,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 253 states have (on average 1.3992094861660078) internal successors, (354), 254 states have internal predecessors, (354), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 05:24:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 428 transitions. [2025-03-17 05:24:02,809 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 428 transitions. Word has length 112 [2025-03-17 05:24:02,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:02,809 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 428 transitions. [2025-03-17 05:24:02,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:24:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 428 transitions. [2025-03-17 05:24:02,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:24:02,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:02,811 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:02,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:24:02,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:02,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:02,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1604085558, now seen corresponding path program 1 times [2025-03-17 05:24:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:02,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938150581] [2025-03-17 05:24:02,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:02,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:24:02,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:24:02,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:02,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:24:02,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1776622071] [2025-03-17 05:24:02,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:02,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:02,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:24:02,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:24:03,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:24:03,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:24:03,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:03,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:03,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:24:03,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:03,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:24:03,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:24:03,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:24:03,829 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 92 treesize of output 36 [2025-03-17 05:24:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:24:04,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:04,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:04,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938150581] [2025-03-17 05:24:04,018 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:24:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776622071] [2025-03-17 05:24:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776622071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:04,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:04,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:24:04,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882894174] [2025-03-17 05:24:04,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:04,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:24:04,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:04,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:24:04,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:24:04,020 INFO L87 Difference]: Start difference. First operand 294 states and 428 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:24:08,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 05:24:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:15,299 INFO L93 Difference]: Finished difference Result 760 states and 1098 transitions. [2025-03-17 05:24:15,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:15,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-03-17 05:24:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:15,303 INFO L225 Difference]: With dead ends: 760 [2025-03-17 05:24:15,303 INFO L226 Difference]: Without dead ends: 467 [2025-03-17 05:24:15,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:24:15,306 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 193 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:15,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 863 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 447 Invalid, 1 Unknown, 0 Unchecked, 10.3s Time] [2025-03-17 05:24:15,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-17 05:24:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 322. [2025-03-17 05:24:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 281 states have (on average 1.395017793594306) internal successors, (392), 282 states have internal predecessors, (392), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 05:24:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 466 transitions. [2025-03-17 05:24:15,337 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 466 transitions. Word has length 114 [2025-03-17 05:24:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:15,339 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 466 transitions. [2025-03-17 05:24:15,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:24:15,339 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 466 transitions. [2025-03-17 05:24:15,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:24:15,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:15,345 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:15,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:24:15,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 05:24:15,546 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:15,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:15,546 INFO L85 PathProgramCache]: Analyzing trace with hash -96533749, now seen corresponding path program 1 times [2025-03-17 05:24:15,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:15,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379237325] [2025-03-17 05:24:15,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:15,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:15,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:24:15,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:24:15,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:15,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:24:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:24:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379237325] [2025-03-17 05:24:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379237325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:17,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:17,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:24:17,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512143665] [2025-03-17 05:24:17,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:17,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:24:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:24:17,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:24:17,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:24:17,793 INFO L87 Difference]: Start difference. First operand 322 states and 466 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:24:26,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:26,945 INFO L93 Difference]: Finished difference Result 716 states and 1032 transitions. [2025-03-17 05:24:26,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:24:26,948 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-17 05:24:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:26,953 INFO L225 Difference]: With dead ends: 716 [2025-03-17 05:24:26,953 INFO L226 Difference]: Without dead ends: 391 [2025-03-17 05:24:26,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:24:26,956 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 260 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:24:26,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 773 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-03-17 05:24:26,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-03-17 05:24:26,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 322. [2025-03-17 05:24:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 281 states have (on average 1.387900355871886) internal successors, (390), 282 states have internal predecessors, (390), 37 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 05:24:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 464 transitions. [2025-03-17 05:24:26,984 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 464 transitions. Word has length 114 [2025-03-17 05:24:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:26,985 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 464 transitions. [2025-03-17 05:24:26,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:24:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 464 transitions. [2025-03-17 05:24:26,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:24:26,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:26,987 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:26,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:24:26,987 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:26,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1238722918, now seen corresponding path program 1 times [2025-03-17 05:24:26,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:24:26,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369690411] [2025-03-17 05:24:26,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:24:27,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:24:27,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:24:27,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:27,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:24:27,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376861001] [2025-03-17 05:24:27,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:27,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:27,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:27,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:24:27,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:24:27,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:24:27,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:24:27,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:27,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:24:27,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:24:27,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:24:27,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:24:27,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:27,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:24:27,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:24:27,641 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:24:27,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:24:27,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:24:27,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:24:27,848 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 05:24:27,912 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:24:27,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:24:27 BoogieIcfgContainer [2025-03-17 05:24:27,916 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:24:27,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:24:27,917 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:24:27,917 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:24:27,918 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:23:59" (3/4) ... [2025-03-17 05:24:27,924 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:24:27,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:24:27,925 INFO L158 Benchmark]: Toolchain (without parser) took 29454.28ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 121.7MB in the beginning and 221.6MB in the end (delta: -99.9MB). Peak memory consumption was 64.4MB. Max. memory is 16.1GB. [2025-03-17 05:24:27,925 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:27,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.36ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 107.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:24:27,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.33ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 104.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:27,926 INFO L158 Benchmark]: Boogie Preprocessor took 55.82ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 101.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:27,926 INFO L158 Benchmark]: IcfgBuilder took 608.06ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 70.5MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:24:27,926 INFO L158 Benchmark]: TraceAbstraction took 28441.67ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 69.9MB in the beginning and 221.7MB in the end (delta: -151.8MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2025-03-17 05:24:27,926 INFO L158 Benchmark]: Witness Printer took 8.04ms. Allocated memory is still 335.5MB. Free memory was 221.7MB in the beginning and 221.6MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:24:27,927 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.48ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.36ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 107.4MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.33ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 104.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.82ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 101.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 608.06ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 70.5MB in the end (delta: 30.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 28441.67ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 69.9MB in the beginning and 221.7MB in the end (delta: -151.8MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Witness Printer took 8.04ms. Allocated memory is still 335.5MB. Free memory was 221.7MB in the beginning and 221.6MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 1, 1, 0, 0, 1 }; [L25-L27] double double_Array_0[1] = { 31.75 }; [L25-L27] double double_Array_0[1] = { 31.75 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L28-L30] signed char signed_char_Array_0[3] = { -25, 4, -8 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L31-L33] signed short int signed_short_int_Array_0[2] = { 32, -4 }; [L34] unsigned char last_1_BOOL_unsigned_char_Array_0_4_ = 1; [L35] signed short int last_1_signed_short_int_Array_0_1_ = -4; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L97] EXPR BOOL_unsigned_char_Array_0[4] [L97] last_1_BOOL_unsigned_char_Array_0_4_ = BOOL_unsigned_char_Array_0[4] [L98] EXPR signed_short_int_Array_0[1] [L98] last_1_signed_short_int_Array_0_1_ = signed_short_int_Array_0[1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L74] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] 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}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] 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}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] 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}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] 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}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L78] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L81] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] double_Array_0[0] = __VERIFIER_nondet_double() [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L84] EXPR double_Array_0[0] [L84] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[2] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[2] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L92] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L93] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] RET updateVariables() [L110] CALL step() [L39] EXPR signed_short_int_Array_0[0] [L39] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L39] COND FALSE !(last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) [L44] EXPR signed_char_Array_0[2] [L44] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] EXPR ((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]) [L44] EXPR signed_char_Array_0[2] [L44] EXPR ((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] signed long int stepLocal_1 = (((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0])); [L45] EXPR signed_char_Array_0[0] [L45] EXPR signed_char_Array_0[2] [L45] signed long int stepLocal_0 = signed_char_Array_0[0] / signed_char_Array_0[2]; [L46] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L46] COND TRUE (- double_Array_0[0]) >= 16.75 [L47] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L47] COND TRUE stepLocal_0 >= signed_char_Array_0[0] [L48] COND TRUE stepLocal_1 > -32 [L49] BOOL_unsigned_char_Array_0[4] = 0 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L63] EXPR signed_char_Array_0[0] [L63] signed char stepLocal_2 = signed_char_Array_0[0]; [L64] EXPR signed_char_Array_0[0] [L64] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L64] EXPR signed_char_Array_0[0] | signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}, stepLocal_2=-25] [L64] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L64] COND TRUE ((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < stepLocal_2 [L65] EXPR signed_short_int_Array_0[0] [L65] signed_short_int_Array_0[1] = (signed_short_int_Array_0[0] - 256) [L69] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L69] COND FALSE !(1 == signed_char_Array_0[2]) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) [L101] EXPR BOOL_unsigned_char_Array_0[4] [L101] EXPR ((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101-L102] return (((((- double_Array_0[0]) >= 16.75) ? (((signed_char_Array_0[0] / signed_char_Array_0[2]) >= signed_char_Array_0[0]) ? ((((((signed_char_Array_0[2]) < (signed_char_Array_0[0])) ? (signed_char_Array_0[2]) : (signed_char_Array_0[0]))) > -32) ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 0)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) (BOOL_unsigned_char_Array_0[3] || BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[3] ? (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1)) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) BOOL_unsigned_char_Array_0[2])))) : (BOOL_unsigned_char_Array_0[4] == ((unsigned char) 1))) && ((1 == signed_char_Array_0[2]) ? (BOOL_unsigned_char_Array_0[1] == ((unsigned char) BOOL_unsigned_char_Array_0[0])) : 1)) && ((((signed_char_Array_0[0] | signed_char_Array_0[0]) + signed_char_Array_0[2]) < signed_char_Array_0[0]) ? (signed_short_int_Array_0[1] == ((signed short int) (signed_short_int_Array_0[0] - 256))) : (signed_short_int_Array_0[1] == ((signed short int) 128)))) && ((last_1_signed_short_int_Array_0_1_ <= (signed_short_int_Array_0[0] / signed_char_Array_0[2])) ? (last_1_BOOL_unsigned_char_Array_0_4_ ? (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1])) : 1) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_4_=1, last_1_signed_short_int_Array_0_1_=-4, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 154 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.3s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1015 SdHoareTripleChecker+Valid, 18.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1014 mSDsluCounter, 2960 SdHoareTripleChecker+Invalid, 17.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2281 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1452 IncrementalHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 679 mSDtfsCounter, 1452 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=322occurred in iteration=4, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 448 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1018 NumberOfCodeBlocks, 1018 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 670 ConstructedInterpolants, 1 QuantifiedInterpolants, 3045 SizeOfPredicates, 3 NumberOfNonLiveVariables, 784 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 2158/2184 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:24:28,143 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-03-17 05:24:28,280 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 137 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-46.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 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:24:30,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:24:30,329 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:24:30,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:24:30,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:24:30,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:24:30,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:24:30,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:24:30,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:24:30,363 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:24:30,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:24:30,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:24:30,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:24:30,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:24:30,364 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:24:30,365 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:30,365 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:24:30,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:24:30,365 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 -> 13a017e811a0741c89c8b84e8861e71b0cc1dab29c6c9c0512aab721a63586fe [2025-03-17 05:24:30,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:24:30,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:24:30,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:24:30,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:24:30,605 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:24:30,607 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-46.i [2025-03-17 05:24:31,842 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e270f5a74/9b6b8eba90fb47759feaeba2878ff830/FLAG287dc8275 [2025-03-17 05:24:32,111 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:24:32,112 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-46.i [2025-03-17 05:24:32,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e270f5a74/9b6b8eba90fb47759feaeba2878ff830/FLAG287dc8275 [2025-03-17 05:24:32,139 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e270f5a74/9b6b8eba90fb47759feaeba2878ff830 [2025-03-17 05:24:32,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:24:32,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:24:32,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:32,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:24:32,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:24:32,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,150 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e5595d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32, skipping insertion in model container [2025-03-17 05:24:32,150 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:24:32,275 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-46.i[916,929] [2025-03-17 05:24:32,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:32,328 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:24:32,339 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-46.i[916,929] [2025-03-17 05:24:32,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:24:32,383 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:24:32,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32 WrapperNode [2025-03-17 05:24:32,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:24:32,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:32,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:24:32,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:24:32,390 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:24:32" (1/1) ... [2025-03-17 05:24:32,401 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:24:32" (1/1) ... [2025-03-17 05:24:32,427 INFO L138 Inliner]: procedures = 33, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 378 [2025-03-17 05:24:32,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:24:32,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:24:32,428 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:24:32,428 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:24:32,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,458 INFO L175 MemorySlicer]: Split 101 memory accesses to 5 slices as follows [2, 37, 8, 40, 14]. 40 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 3, 2]. The 16 writes are split as follows [0, 9, 1, 3, 3]. [2025-03-17 05:24:32,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,486 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:24:32,521 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:24:32,521 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:24:32,521 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:24:32,522 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (1/1) ... [2025-03-17 05:24:32,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:24:32,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:24:32,555 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:24:32,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:24:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:24:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:24:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:24:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:24:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:24:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:24:32,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:24:32,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:24:32,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:24:32,595 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:24:32,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:24:32,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:24:32,735 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:24:32,737 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:24:33,361 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem57#1;havoc property_#t~ite79#1;havoc property_#t~mem58#1;havoc property_#t~mem59#1;havoc property_#t~mem60#1;havoc property_#t~ite77#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite65#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~ite71#1;havoc property_#t~mem66#1;havoc property_#t~mem70#1;havoc property_#t~mem67#1;havoc property_#t~mem68#1;havoc property_#t~short69#1;havoc property_#t~mem72#1;havoc property_#t~ite76#1;havoc property_#t~mem73#1;havoc property_#t~mem75#1;havoc property_#t~mem74#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short84#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite99#1;havoc property_#t~ite98#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~short100#1; [2025-03-17 05:24:33,397 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-03-17 05:24:33,397 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:24:33,407 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:24:33,407 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:24:33,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:33 BoogieIcfgContainer [2025-03-17 05:24:33,407 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:24:33,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:24:33,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:24:33,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:24:33,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:24:32" (1/3) ... [2025-03-17 05:24:33,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3247b7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:33, skipping insertion in model container [2025-03-17 05:24:33,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:24:32" (2/3) ... [2025-03-17 05:24:33,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3247b7d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:24:33, skipping insertion in model container [2025-03-17 05:24:33,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:24:33" (3/3) ... [2025-03-17 05:24:33,418 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-46.i [2025-03-17 05:24:33,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:24:33,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-46.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:24:33,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:24:33,505 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5f1cd564, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:24:33,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:24:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:24:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 05:24:33,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:33,519 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:33,520 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:33,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash 2116955379, now seen corresponding path program 1 times [2025-03-17 05:24:33,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:33,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129968735] [2025-03-17 05:24:33,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:33,535 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:24:33,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:33,543 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:24:33,545 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:24:33,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:24:33,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:24:33,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:33,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:33,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:24:33,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:33,872 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2025-03-17 05:24:33,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:24:33,872 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:33,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129968735] [2025-03-17 05:24:33,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129968735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:24:33,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:24:33,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:24:33,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496587271] [2025-03-17 05:24:33,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:24:33,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:24:33,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:33,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:24:33,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:24:33,908 INFO L87 Difference]: Start difference. First operand has 87 states, 70 states have (on average 1.4285714285714286) internal successors, (100), 71 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:24:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:24:33,929 INFO L93 Difference]: Finished difference Result 171 states and 268 transitions. [2025-03-17 05:24:33,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:24:33,931 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2025-03-17 05:24:33,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:24:33,936 INFO L225 Difference]: With dead ends: 171 [2025-03-17 05:24:33,937 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 05:24:33,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 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:24:33,942 INFO L435 NwaCegarLoop]: 124 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, 124 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:24:33,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:24:33,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 05:24:33,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-17 05:24:33,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.391304347826087) internal successors, (96), 69 states have internal predecessors, (96), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:24:33,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2025-03-17 05:24:33,980 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 110 [2025-03-17 05:24:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:24:33,980 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2025-03-17 05:24:33,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:24:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2025-03-17 05:24:33,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 05:24:33,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:24:33,984 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:24:33,998 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:24:34,185 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:24:34,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:24:34,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:24:34,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1742540939, now seen corresponding path program 1 times [2025-03-17 05:24:34,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:24:34,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172085803] [2025-03-17 05:24:34,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:34,187 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:24:34,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:24:34,190 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:24:34,197 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:24:34,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:24:34,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:24:34,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:34,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:34,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:24:34,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:34,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-17 05:24:34,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:24:36,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2025-03-17 05:24:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 127 proven. 6 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 05:24:36,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:38,556 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 23 treesize of output 15 [2025-03-17 05:24:39,000 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:24:39,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172085803] [2025-03-17 05:24:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172085803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:39,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1754243887] [2025-03-17 05:24:39,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:24:39,000 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:24:39,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:24:39,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:24:39,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-03-17 05:24:39,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:24:39,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:24:39,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:24:39,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:24:39,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:24:39,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:24:39,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 05:24:40,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 05:24:41,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:24:42,676 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 26 treesize of output 18 [2025-03-17 05:24:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-03-17 05:24:43,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:24:43,724 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 23 treesize of output 15 [2025-03-17 05:24:43,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1754243887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:24:43,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:24:43,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2025-03-17 05:24:43,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307564934] [2025-03-17 05:24:43,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:24:43,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 05:24:43,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:24:43,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 05:24:43,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:24:43,909 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand has 23 states, 20 states have (on average 4.4) internal successors, (88), 21 states have internal predecessors, (88), 7 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) [2025-03-17 05:25:06,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:06,221 INFO L93 Difference]: Finished difference Result 342 states and 488 transitions. [2025-03-17 05:25:06,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-17 05:25:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.4) internal successors, (88), 21 states have internal predecessors, (88), 7 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) Word has length 110 [2025-03-17 05:25:06,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:06,231 INFO L225 Difference]: With dead ends: 342 [2025-03-17 05:25:06,232 INFO L226 Difference]: Without dead ends: 258 [2025-03-17 05:25:06,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=613, Invalid=2249, Unknown=0, NotChecked=0, Total=2862 [2025-03-17 05:25:06,235 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 1070 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:06,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 927 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2025-03-17 05:25:06,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-17 05:25:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 205. [2025-03-17 05:25:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 161 states have (on average 1.3416149068322982) internal successors, (216), 162 states have internal predecessors, (216), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 05:25:06,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 290 transitions. [2025-03-17 05:25:06,266 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 290 transitions. Word has length 110 [2025-03-17 05:25:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:06,266 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 290 transitions. [2025-03-17 05:25:06,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.4) internal successors, (88), 21 states have internal predecessors, (88), 7 states have call successors, (28), 5 states have call predecessors, (28), 7 states have return successors, (28), 5 states have call predecessors, (28), 7 states have call successors, (28) [2025-03-17 05:25:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 290 transitions. [2025-03-17 05:25:06,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 05:25:06,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:06,270 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:06,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-03-17 05:25:06,479 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:25:06,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:25:06,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:06,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2035943946, now seen corresponding path program 1 times [2025-03-17 05:25:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:06,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701003932] [2025-03-17 05:25:06,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:06,672 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:25:06,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:06,674 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:25:06,675 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:25:06,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 05:25:06,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 05:25:06,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:06,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:06,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:25:06,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:06,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-17 05:25:06,885 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 43 treesize of output 25 [2025-03-17 05:25:06,917 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:25:06,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:06,917 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:06,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701003932] [2025-03-17 05:25:06,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701003932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:06,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:06,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:06,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486933753] [2025-03-17 05:25:06,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:06,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:06,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:06,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:06,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:06,919 INFO L87 Difference]: Start difference. First operand 205 states and 290 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:25:07,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:07,272 INFO L93 Difference]: Finished difference Result 478 states and 686 transitions. [2025-03-17 05:25:07,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:07,272 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2025-03-17 05:25:07,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:07,275 INFO L225 Difference]: With dead ends: 478 [2025-03-17 05:25:07,275 INFO L226 Difference]: Without dead ends: 353 [2025-03-17 05:25:07,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:07,276 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 111 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:07,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 447 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:25:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-17 05:25:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 221. [2025-03-17 05:25:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 177 states have (on average 1.3389830508474576) internal successors, (237), 178 states have internal predecessors, (237), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 05:25:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 311 transitions. [2025-03-17 05:25:07,299 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 311 transitions. Word has length 110 [2025-03-17 05:25:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:07,299 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 311 transitions. [2025-03-17 05:25:07,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:25:07,299 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 311 transitions. [2025-03-17 05:25:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:07,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:07,302 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:07,321 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 (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:25:07,502 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:25:07,503 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:07,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash -694359500, now seen corresponding path program 1 times [2025-03-17 05:25:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:07,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401484471] [2025-03-17 05:25:07,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:07,504 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:25:07,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:07,506 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:25:07,513 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:25:07,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:07,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:07,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:07,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:07,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:25:07,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:09,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:09,925 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 144 treesize of output 54 [2025-03-17 05:25:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-17 05:25:10,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:10,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401484471] [2025-03-17 05:25:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401484471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:10,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:25:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079012124] [2025-03-17 05:25:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:10,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:25:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:10,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:25:10,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:25:10,056 INFO L87 Difference]: Start difference. First operand 221 states and 311 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:25:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:12,376 INFO L93 Difference]: Finished difference Result 660 states and 929 transitions. [2025-03-17 05:25:12,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:25:12,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-03-17 05:25:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:12,380 INFO L225 Difference]: With dead ends: 660 [2025-03-17 05:25:12,380 INFO L226 Difference]: Without dead ends: 521 [2025-03-17 05:25:12,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:25:12,381 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 304 mSDsluCounter, 888 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:12,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1087 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 05:25:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-17 05:25:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 501. [2025-03-17 05:25:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 406 states have (on average 1.3399014778325122) internal successors, (544), 412 states have internal predecessors, (544), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 704 transitions. [2025-03-17 05:25:12,437 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 704 transitions. Word has length 112 [2025-03-17 05:25:12,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:12,437 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 704 transitions. [2025-03-17 05:25:12,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:25:12,438 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 704 transitions. [2025-03-17 05:25:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:12,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:12,440 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:12,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:25:12,640 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:25:12,641 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:12,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:12,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1378041612, now seen corresponding path program 1 times [2025-03-17 05:25:12,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:12,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962456926] [2025-03-17 05:25:12,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:12,642 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:25:12,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:12,647 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:25:12,656 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:25:12,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:12,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:12,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:12,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:12,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:25:12,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:12,936 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 23 treesize of output 11 [2025-03-17 05:25:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:25:13,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:13,201 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:13,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962456926] [2025-03-17 05:25:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962456926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706656315] [2025-03-17 05:25:13,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:13,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:13,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:13,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:13,203 INFO L87 Difference]: Start difference. First operand 501 states and 704 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:25:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:16,930 INFO L93 Difference]: Finished difference Result 996 states and 1408 transitions. [2025-03-17 05:25:16,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:16,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-03-17 05:25:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:16,939 INFO L225 Difference]: With dead ends: 996 [2025-03-17 05:25:16,939 INFO L226 Difference]: Without dead ends: 664 [2025-03-17 05:25:16,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:25:16,941 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 77 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:16,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 394 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-17 05:25:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-03-17 05:25:16,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 501. [2025-03-17 05:25:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 406 states have (on average 1.332512315270936) internal successors, (541), 412 states have internal predecessors, (541), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 701 transitions. [2025-03-17 05:25:16,992 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 701 transitions. Word has length 112 [2025-03-17 05:25:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:16,992 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 701 transitions. [2025-03-17 05:25:16,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:25:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 701 transitions. [2025-03-17 05:25:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:16,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:16,995 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:17,004 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:25:17,195 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:25:17,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:17,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:17,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1574555117, now seen corresponding path program 1 times [2025-03-17 05:25:17,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:17,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027080493] [2025-03-17 05:25:17,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:17,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:17,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:17,199 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:25:17,200 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:25:17,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:17,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:17,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:17,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:17,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:25:17,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:25:17,420 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:17,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:17,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027080493] [2025-03-17 05:25:17,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027080493] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:17,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:17,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:25:17,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730591900] [2025-03-17 05:25:17,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:17,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:25:17,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:17,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:25:17,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:17,422 INFO L87 Difference]: Start difference. First operand 501 states and 701 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:25:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:17,511 INFO L93 Difference]: Finished difference Result 896 states and 1266 transitions. [2025-03-17 05:25:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:25:17,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 112 [2025-03-17 05:25:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:17,517 INFO L225 Difference]: With dead ends: 896 [2025-03-17 05:25:17,517 INFO L226 Difference]: Without dead ends: 516 [2025-03-17 05:25:17,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:25:17,519 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:17,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-17 05:25:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-17 05:25:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 421 states have (on average 1.3206650831353919) internal successors, (556), 427 states have internal predecessors, (556), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 716 transitions. [2025-03-17 05:25:17,558 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 716 transitions. Word has length 112 [2025-03-17 05:25:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:17,558 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 716 transitions. [2025-03-17 05:25:17,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:25:17,558 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 716 transitions. [2025-03-17 05:25:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-17 05:25:17,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:17,560 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:17,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 05:25:17,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:17,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:17,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:17,761 INFO L85 PathProgramCache]: Analyzing trace with hash -250748077, now seen corresponding path program 1 times [2025-03-17 05:25:17,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:17,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998515996] [2025-03-17 05:25:17,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:17,762 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:25:17,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:17,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:17,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 05:25:17,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-17 05:25:17,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-17 05:25:17,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:17,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:17,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:25:17,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-03-17 05:25:18,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:18,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:18,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998515996] [2025-03-17 05:25:18,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998515996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:18,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:18,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:25:18,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733322927] [2025-03-17 05:25:18,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:18,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:25:18,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:18,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:25:18,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:18,026 INFO L87 Difference]: Start difference. First operand 516 states and 716 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:25:18,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:18,137 INFO L93 Difference]: Finished difference Result 961 states and 1338 transitions. [2025-03-17 05:25:18,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:25:18,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-03-17 05:25:18,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:18,141 INFO L225 Difference]: With dead ends: 961 [2025-03-17 05:25:18,141 INFO L226 Difference]: Without dead ends: 516 [2025-03-17 05:25:18,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:25:18,145 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:18,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:25:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-03-17 05:25:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 516. [2025-03-17 05:25:18,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 421 states have (on average 1.3135391923990498) internal successors, (553), 427 states have internal predecessors, (553), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 713 transitions. [2025-03-17 05:25:18,183 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 713 transitions. Word has length 112 [2025-03-17 05:25:18,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:18,183 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 713 transitions. [2025-03-17 05:25:18,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 05:25:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 713 transitions. [2025-03-17 05:25:18,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:25:18,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:18,185 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:18,193 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 (9)] Forceful destruction successful, exit code 0 [2025-03-17 05:25:18,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:18,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:18,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1192154965, now seen corresponding path program 1 times [2025-03-17 05:25:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:18,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588461974] [2025-03-17 05:25:18,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:18,386 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:25:18,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:18,388 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:18,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 05:25:18,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:25:18,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:25:18,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:18,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:18,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:25:18,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:18,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:18,800 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 61 treesize of output 27 [2025-03-17 05:25:19,424 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:25:19,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:25:19,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:19,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588461974] [2025-03-17 05:25:19,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588461974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:25:19,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:25:19,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:25:19,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038245347] [2025-03-17 05:25:19,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:19,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:25:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:19,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:25:19,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:25:19,426 INFO L87 Difference]: Start difference. First operand 516 states and 713 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:25:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:24,481 INFO L93 Difference]: Finished difference Result 1493 states and 2078 transitions. [2025-03-17 05:25:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:25:24,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-17 05:25:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:24,492 INFO L225 Difference]: With dead ends: 1493 [2025-03-17 05:25:24,492 INFO L226 Difference]: Without dead ends: 1098 [2025-03-17 05:25:24,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:25:24,494 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 207 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:24,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 834 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-03-17 05:25:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-03-17 05:25:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 597. [2025-03-17 05:25:24,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 502 states have (on average 1.346613545816733) internal successors, (676), 508 states have internal predecessors, (676), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:24,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 836 transitions. [2025-03-17 05:25:24,543 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 836 transitions. Word has length 113 [2025-03-17 05:25:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:24,543 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 836 transitions. [2025-03-17 05:25:24,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:25:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 836 transitions. [2025-03-17 05:25:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-17 05:25:24,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:24,545 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:24,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-17 05:25:24,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:24,745 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:24,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:24,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1749502634, now seen corresponding path program 1 times [2025-03-17 05:25:24,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:24,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359850191] [2025-03-17 05:25:24,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:24,747 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:25:24,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:24,749 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:24,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 05:25:24,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-17 05:25:24,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-17 05:25:24,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:24,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:24,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:25:25,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:25,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 05:25:25,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-03-17 05:25:25,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-03-17 05:25:25,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2025-03-17 05:25:25,810 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:25,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 42 [2025-03-17 05:25:25,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:25,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 44 [2025-03-17 05:25:26,075 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 28 proven. 72 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:25:26,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 05:25:26,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:26,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359850191] [2025-03-17 05:25:26,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1359850191] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:25:26,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:25:26,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2025-03-17 05:25:26,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117740313] [2025-03-17 05:25:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:25:26,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:25:26,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:26,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:25:26,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:25:26,301 INFO L87 Difference]: Start difference. First operand 597 states and 836 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:25:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:25:26,727 INFO L93 Difference]: Finished difference Result 1149 states and 1615 transitions. [2025-03-17 05:25:26,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:25:26,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2025-03-17 05:25:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:25:26,730 INFO L225 Difference]: With dead ends: 1149 [2025-03-17 05:25:26,731 INFO L226 Difference]: Without dead ends: 665 [2025-03-17 05:25:26,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:25:26,733 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 42 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:25:26,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 673 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:25:26,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-17 05:25:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 591. [2025-03-17 05:25:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 496 states have (on average 1.3508064516129032) internal successors, (670), 502 states have internal predecessors, (670), 80 states have call successors, (80), 14 states have call predecessors, (80), 14 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 05:25:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 830 transitions. [2025-03-17 05:25:26,760 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 830 transitions. Word has length 113 [2025-03-17 05:25:26,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:25:26,761 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 830 transitions. [2025-03-17 05:25:26,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 05:25:26,761 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 830 transitions. [2025-03-17 05:25:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 05:25:26,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:25:26,762 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:25:26,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 05:25:26,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:25:26,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:25:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:25:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1747240842, now seen corresponding path program 1 times [2025-03-17 05:25:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:25:26,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22946805] [2025-03-17 05:25:26,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:25:26,963 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:25:26,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:25:26,965 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:25:26,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-17 05:25:27,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-17 05:25:27,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 05:25:27,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:25:27,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:25:27,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:25:27,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:25:28,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:28,379 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 95 treesize of output 35 [2025-03-17 05:25:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 193 proven. 21 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-03-17 05:25:28,451 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:25:29,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:25:29,055 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 100 treesize of output 1 [2025-03-17 05:25:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 21 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 05:25:29,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:25:29,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22946805] [2025-03-17 05:25:29,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22946805] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:25:29,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:25:29,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-17 05:25:29,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333787482] [2025-03-17 05:25:29,106 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:25:29,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:25:29,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:25:29,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:25:29,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:25:29,107 INFO L87 Difference]: Start difference. First operand 591 states and 830 transitions. Second operand has 15 states, 13 states have (on average 6.538461538461538) internal successors, (85), 15 states have internal predecessors, (85), 6 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 4 states have call predecessors, (28), 6 states have call successors, (28)