./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.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 1689f85c28d1e6434194d2a6f7eb0aae66aa4ed557053bab0b2942bb334560be --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:02:33,339 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:02:33,395 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:02:33,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:02:33,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:02:33,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:02:33,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:02:33,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:02:33,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:02:33,419 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:02:33,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:02:33,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:02:33,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:02:33,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:02:33,421 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:02:33,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:02:33,421 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:02:33,421 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:02:33,421 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:02:33,421 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:02:33,421 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:02:33,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:02:33,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:02:33,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:02:33,422 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:02:33,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:02:33,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:02:33,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:02:33,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:02:33,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:02:33,422 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:02:33,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:02:33,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:33,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:02:33,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:02:33,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:02:33,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:02:33,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:02:33,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:02:33,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:02:33,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:02:33,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:02:33,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:02:33,424 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 -> 1689f85c28d1e6434194d2a6f7eb0aae66aa4ed557053bab0b2942bb334560be [2025-03-04 01:02:33,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:02:33,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:02:33,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:02:33,635 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:02:33,636 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:02:33,636 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-16.i [2025-03-04 01:02:34,763 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5057fee32/d3e6112f6ecb4573b1d0ef748ad5985e/FLAG34556c04d [2025-03-04 01:02:35,050 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:02:35,050 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.i [2025-03-04 01:02:35,058 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5057fee32/d3e6112f6ecb4573b1d0ef748ad5985e/FLAG34556c04d [2025-03-04 01:02:35,338 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5057fee32/d3e6112f6ecb4573b1d0ef748ad5985e [2025-03-04 01:02:35,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:02:35,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:02:35,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:35,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:02:35,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:02:35,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21eeb8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35, skipping insertion in model container [2025-03-04 01:02:35,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:02:35,472 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-16.i[916,929] [2025-03-04 01:02:35,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:35,531 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:02:35,539 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-16.i[916,929] [2025-03-04 01:02:35,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:35,593 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:02:35,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35 WrapperNode [2025-03-04 01:02:35,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:35,595 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:35,595 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:02:35,595 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:02:35,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,647 INFO L138 Inliner]: procedures = 29, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2025-03-04 01:02:35,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:35,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:02:35,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:02:35,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:02:35,656 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,660 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,680 INFO L175 MemorySlicer]: Split 124 memory accesses to 5 slices as follows [2, 19, 34, 46, 23]. 37 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 3, 5, 3]. The 17 writes are split as follows [0, 3, 3, 7, 4]. [2025-03-04 01:02:35,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,706 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:02:35,714 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:02:35,718 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:02:35,719 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:02:35,720 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (1/1) ... [2025-03-04 01:02:35,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:35,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:02:35,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:02:35,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:02:35,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:02:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:02:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:02:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:02:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:02:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:02:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:02:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:02:35,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:02:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:02:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:02:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:02:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:02:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:02:35,768 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:02:35,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:02:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:02:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:02:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:02:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:02:35,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:02:35,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:02:35,870 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:02:35,872 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:02:36,210 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~short86#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short91#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite113#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~ite112#1;havoc property_#t~mem104#1;havoc property_#t~mem98#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite126#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short120#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-04 01:02:36,247 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-03-04 01:02:36,247 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:02:36,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:02:36,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:02:36,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:36 BoogieIcfgContainer [2025-03-04 01:02:36,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:02:36,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:02:36,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:02:36,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:02:36,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:02:35" (1/3) ... [2025-03-04 01:02:36,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a5069b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:36, skipping insertion in model container [2025-03-04 01:02:36,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:35" (2/3) ... [2025-03-04 01:02:36,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a5069b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:36, skipping insertion in model container [2025-03-04 01:02:36,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:36" (3/3) ... [2025-03-04 01:02:36,263 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-16.i [2025-03-04 01:02:36,272 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:02:36,273 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-16.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:02:36,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:02:36,319 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;@7a2a582a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:02:36,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:02:36,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:02:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:02:36,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:36,331 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:36,331 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:36,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:36,334 INFO L85 PathProgramCache]: Analyzing trace with hash -703773019, now seen corresponding path program 1 times [2025-03-04 01:02:36,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:36,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183247676] [2025-03-04 01:02:36,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:36,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:36,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:02:36,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:02:36,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:36,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 01:02:36,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183247676] [2025-03-04 01:02:36,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183247676] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490887368] [2025-03-04 01:02:36,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:36,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:36,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:36,594 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:02:36,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:02:36,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:02:36,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:02:36,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:36,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:36,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:02:36,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 01:02:36,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:36,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490887368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:36,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:02:36,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:02:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549136013] [2025-03-04 01:02:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:36,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:02:36,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:36,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:02:36,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:02:36,808 INFO L87 Difference]: Start difference. First operand has 109 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:02:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:36,834 INFO L93 Difference]: Finished difference Result 212 states and 336 transitions. [2025-03-04 01:02:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:02:36,835 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2025-03-04 01:02:36,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:36,842 INFO L225 Difference]: With dead ends: 212 [2025-03-04 01:02:36,842 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:02:36,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:02:36,847 INFO L435 NwaCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:36,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:02:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-04 01:02:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.3614457831325302) internal successors, (113), 83 states have internal predecessors, (113), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:02:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2025-03-04 01:02:36,876 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 157 [2025-03-04 01:02:36,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:36,877 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2025-03-04 01:02:36,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:02:36,877 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2025-03-04 01:02:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:02:36,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:36,880 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:36,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:02:37,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:02:37,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:37,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:37,081 INFO L85 PathProgramCache]: Analyzing trace with hash 681947474, now seen corresponding path program 1 times [2025-03-04 01:02:37,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:37,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77319289] [2025-03-04 01:02:37,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:37,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:37,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:02:37,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:02:37,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:37,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:37,390 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:02:37,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:02:37,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77319289] [2025-03-04 01:02:37,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77319289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:37,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:37,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:02:37,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464308019] [2025-03-04 01:02:37,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:37,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:02:37,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:02:37,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:02:37,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:02:37,394 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:02:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:37,431 INFO L93 Difference]: Finished difference Result 211 states and 310 transitions. [2025-03-04 01:02:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:02:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2025-03-04 01:02:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:37,434 INFO L225 Difference]: With dead ends: 211 [2025-03-04 01:02:37,434 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 01:02:37,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:02:37,437 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:37,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 01:02:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 01:02:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:02:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 157 transitions. [2025-03-04 01:02:37,453 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 157 transitions. Word has length 157 [2025-03-04 01:02:37,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:37,454 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 157 transitions. [2025-03-04 01:02:37,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:02:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 157 transitions. [2025-03-04 01:02:37,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:02:37,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:37,460 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:37,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:02:37,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:37,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash 974333299, now seen corresponding path program 1 times [2025-03-04 01:02:37,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:02:37,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004753511] [2025-03-04 01:02:37,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:02:37,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:02:37,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:02:37,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:37,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:02:37,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [421099790] [2025-03-04 01:02:37,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:37,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:02:37,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:37,652 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-04 01:02:37,654 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-04 01:02:37,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:02:37,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:02:37,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:37,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:02:37,912 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:02:37,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:02:38,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:02:38,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:38,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:02:38,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:02:38,159 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:02:38,160 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:02:38,171 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-04 01:02:38,365 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,SelfDestructingSolverStorable2 [2025-03-04 01:02:38,367 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 01:02:38,440 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:02:38,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:02:38 BoogieIcfgContainer [2025-03-04 01:02:38,443 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:02:38,443 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:02:38,443 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:02:38,444 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:02:38,444 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:36" (3/4) ... [2025-03-04 01:02:38,446 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:02:38,446 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:02:38,447 INFO L158 Benchmark]: Toolchain (without parser) took 3105.63ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 86.8MB in the end (delta: 18.3MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2025-03-04 01:02:38,447 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:02:38,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.49ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 91.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:02:38,447 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.57ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:02:38,447 INFO L158 Benchmark]: Boogie Preprocessor took 63.48ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 83.7MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:02:38,448 INFO L158 Benchmark]: IcfgBuilder took 539.92ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 52.6MB in the end (delta: 31.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 01:02:38,448 INFO L158 Benchmark]: TraceAbstraction took 2187.32ms. Allocated memory is still 142.6MB. Free memory was 52.6MB in the beginning and 86.9MB in the end (delta: -34.3MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2025-03-04 01:02:38,448 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 86.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:02:38,449 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.49ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 91.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.57ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 87.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 63.48ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 83.7MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 539.92ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 52.6MB in the end (delta: 31.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2187.32ms. Allocated memory is still 142.6MB. Free memory was 52.6MB in the beginning and 86.9MB in the end (delta: -34.3MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 142.6MB. Free memory was 86.9MB in the beginning and 86.8MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 1, 0, 1 }; [L25-L27] float float_Array_0[3] = { 3.8, 2.75, 1000000.8 }; [L25-L27] float float_Array_0[3] = { 3.8, 2.75, 1000000.8 }; [L25-L27] float float_Array_0[3] = { 3.8, 2.75, 1000000.8 }; [L25-L27] float float_Array_0[3] = { 3.8, 2.75, 1000000.8 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L28-L30] signed char signed_char_Array_0[5] = { 32, 25, 2, 0, 2 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { -32, 256, 4 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { -32, 256, 4 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { -32, 256, 4 }; [L31-L33] signed short int signed_short_int_Array_0[3] = { -32, 256, 4 }; [L34] signed char last_1_signed_char_Array_0_1_ = 25; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR signed_char_Array_0[1] [L98] last_1_signed_char_Array_0_1_ = signed_char_Array_0[1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L71] float_Array_0[0] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F [L72] EXPR float_Array_0[0] [L72] EXPR float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] EXPR (float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854765600e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854765600e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L73] float_Array_0[1] = __VERIFIER_nondet_float() [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F [L74] EXPR float_Array_0[1] [L74] EXPR float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] EXPR (float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854776000e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854776000e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] CALL assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L75] RET assume_abort_if_not(float_Array_0[1] != 0.0F) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L76] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[0] >= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[0] >= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L79] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[2] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[2] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L82] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L85] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[4] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[4] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L88] signed_short_int_Array_0[1] = __VERIFIER_nondet_short() [L89] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[1] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[1] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(signed_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(signed_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L92] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L93] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L93] RET assume_abort_if_not(signed_short_int_Array_0[2] >= -32768) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L94] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L95] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L95] CALL assume_abort_if_not(signed_short_int_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, 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, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L95] RET assume_abort_if_not(signed_short_int_Array_0[2] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L109] RET updateVariables() [L110] CALL step() [L38] EXPR signed_short_int_Array_0[2] [L38] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L38] EXPR ((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1]) [L38] EXPR signed_short_int_Array_0[2] [L38] EXPR ((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L38] COND FALSE !((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) [L41] EXPR float_Array_0[0] [L41] float_Array_0[2] = float_Array_0[0] [L42] EXPR signed_char_Array_0[3] [L42] signed char stepLocal_2 = signed_char_Array_0[3]; [L43] EXPR float_Array_0[1] [L43] unsigned char stepLocal_1 = 99999.375 <= float_Array_0[1]; [L44] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L44] COND FALSE !(signed_char_Array_0[2] <= stepLocal_2) [L49] signed_short_int_Array_0[0] = -25 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L51] EXPR BOOL_unsigned_char_Array_0[0] [L51] unsigned char stepLocal_0 = BOOL_unsigned_char_Array_0[0]; [L52] EXPR float_Array_0[0] [L52] EXPR float_Array_0[2] [L52] EXPR float_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L52] COND FALSE !(float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR signed_short_int_Array_0[2] [L101] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1]) [L101] EXPR signed_short_int_Array_0[2] [L101] EXPR ((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1 [L101] EXPR ((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0])) [L101] EXPR float_Array_0[2] [L101] EXPR float_Array_0[0] [L101] EXPR (((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0]))) && ((float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) ((((((signed_char_Array_0[3]) > (5)) ? (signed_char_Array_0[3]) : (5))) + (signed_char_Array_0[0] - signed_char_Array_0[2])) - signed_char_Array_0[4]))) : ((float_Array_0[1] > float_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[3])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR ((((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0]))) && ((float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) ((((((signed_char_Array_0[3]) > (5)) ? (signed_char_Array_0[3]) : (5))) + (signed_char_Array_0[0] - signed_char_Array_0[2])) - signed_char_Array_0[4]))) : ((float_Array_0[1] > float_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[3])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0]))) && ((float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) ((((((signed_char_Array_0[3]) > (5)) ? (signed_char_Array_0[3]) : (5))) + (signed_char_Array_0[0] - signed_char_Array_0[2])) - signed_char_Array_0[4]))) : ((float_Array_0[1] > float_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[3])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])))) : 1)) && ((signed_char_Array_0[2] <= signed_char_Array_0[3]) ? (((float_Array_0[0] < float_Array_0[2]) && (99999.375 <= float_Array_0[1])) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[2] + signed_char_Array_0[4]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) -25))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101] EXPR (((((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0]))) && ((float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) ((((((signed_char_Array_0[3]) > (5)) ? (signed_char_Array_0[3]) : (5))) + (signed_char_Array_0[0] - signed_char_Array_0[2])) - signed_char_Array_0[4]))) : ((float_Array_0[1] > float_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[3])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])))) : 1)) && ((signed_char_Array_0[2] <= signed_char_Array_0[3]) ? (((float_Array_0[0] < float_Array_0[2]) && (99999.375 <= float_Array_0[1])) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[2] + signed_char_Array_0[4]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) -25))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L101-L102] return (((((last_1_signed_char_Array_0_1_ % ((((signed_short_int_Array_0[2]) > (signed_short_int_Array_0[1])) ? (signed_short_int_Array_0[2]) : (signed_short_int_Array_0[1])))) <= -1000000) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[1] || BOOL_unsigned_char_Array_0[0]))) : 1) && (float_Array_0[2] == ((float) float_Array_0[0]))) && ((float_Array_0[0] < (float_Array_0[2] / float_Array_0[1])) ? ((BOOL_unsigned_char_Array_0[2] || BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) ((((((signed_char_Array_0[3]) > (5)) ? (signed_char_Array_0[3]) : (5))) + (signed_char_Array_0[0] - signed_char_Array_0[2])) - signed_char_Array_0[4]))) : ((float_Array_0[1] > float_Array_0[0]) ? (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[3])) : (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])))) : 1)) && ((signed_char_Array_0[2] <= signed_char_Array_0[3]) ? (((float_Array_0[0] < float_Array_0[2]) && (99999.375 <= float_Array_0[1])) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_char_Array_0[2] + signed_char_Array_0[4]))) : 1) : (signed_short_int_Array_0[0] == ((signed short int) -25))) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1_=25, signed_char_Array_0={6:0}, signed_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 603 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 295 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 308 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 468 ConstructedInterpolants, 0 QuantifiedInterpolants, 470 SizeOfPredicates, 0 NumberOfNonLiveVariables, 499 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2480/2520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:02:38,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.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 1689f85c28d1e6434194d2a6f7eb0aae66aa4ed557053bab0b2942bb334560be --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:02:40,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:02:40,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:02:40,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:02:40,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:02:40,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:02:40,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:02:40,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:02:40,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:02:40,527 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:02:40,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:02:40,528 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:02:40,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:02:40,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:02:40,528 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:02:40,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:02:40,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:02:40,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:02:40,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:02:40,529 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:02:40,530 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:02:40,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:02:40,530 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:02:40,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:02:40,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:40,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:02:40,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:02:40,530 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:02:40,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:02:40,530 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:02:40,531 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:02:40,531 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:02:40,531 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:02:40,531 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:02:40,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:02:40,531 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 -> 1689f85c28d1e6434194d2a6f7eb0aae66aa4ed557053bab0b2942bb334560be [2025-03-04 01:02:40,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:02:40,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:02:40,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:02:40,769 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:02:40,771 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:02:40,772 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-16.i [2025-03-04 01:02:41,994 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a82e5f1/4ffc12faafd7470793c232fb905e95be/FLAGefb44b01a [2025-03-04 01:02:42,165 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:02:42,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-16.i [2025-03-04 01:02:42,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a82e5f1/4ffc12faafd7470793c232fb905e95be/FLAGefb44b01a [2025-03-04 01:02:42,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24a82e5f1/4ffc12faafd7470793c232fb905e95be [2025-03-04 01:02:42,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:02:42,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:02:42,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:42,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:02:42,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:02:42,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3760e476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42, skipping insertion in model container [2025-03-04 01:02:42,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:02:42,327 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-16.i[916,929] [2025-03-04 01:02:42,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:42,402 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:02:42,411 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-16.i[916,929] [2025-03-04 01:02:42,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:02:42,482 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:02:42,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42 WrapperNode [2025-03-04 01:02:42,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:02:42,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:42,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:02:42,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:02:42,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,547 INFO L138 Inliner]: procedures = 33, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 459 [2025-03-04 01:02:42,549 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:02:42,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:02:42,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:02:42,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:02:42,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,597 INFO L175 MemorySlicer]: Split 124 memory accesses to 5 slices as follows [2, 19, 34, 46, 23]. 37 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 3, 5, 3]. The 17 writes are split as follows [0, 3, 3, 7, 4]. [2025-03-04 01:02:42,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:02:42,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:02:42,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:02:42,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:02:42,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (1/1) ... [2025-03-04 01:02:42,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:02:42,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:02:42,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:02:42,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:02:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:02:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:02:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:02:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:02:42,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:02:42,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:02:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:02:42,812 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:02:42,814 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:02:46,028 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~short86#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short91#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite113#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~ite112#1;havoc property_#t~mem104#1;havoc property_#t~mem98#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~short114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite126#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short120#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-04 01:02:46,068 INFO L? ?]: Removed 99 outVars from TransFormulas that were not future-live. [2025-03-04 01:02:46,068 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:02:46,076 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:02:46,076 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:02:46,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:46 BoogieIcfgContainer [2025-03-04 01:02:46,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:02:46,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:02:46,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:02:46,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:02:46,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:02:42" (1/3) ... [2025-03-04 01:02:46,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2ec958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:46, skipping insertion in model container [2025-03-04 01:02:46,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:02:42" (2/3) ... [2025-03-04 01:02:46,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2ec958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:02:46, skipping insertion in model container [2025-03-04 01:02:46,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:02:46" (3/3) ... [2025-03-04 01:02:46,084 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-16.i [2025-03-04 01:02:46,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:02:46,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-16.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:02:46,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:02:46,136 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;@3a559d4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:02:46,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:02:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:02:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:02:46,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:46,148 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:46,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:46,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:46,152 INFO L85 PathProgramCache]: Analyzing trace with hash -703773019, now seen corresponding path program 1 times [2025-03-04 01:02:46,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:02:46,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475247923] [2025-03-04 01:02:46,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:46,161 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:02:46,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:02:46,163 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:02:46,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:02:46,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:02:46,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:02:46,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:46,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:46,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:02:46,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:46,668 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-04 01:02:46,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:46,669 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:02:46,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475247923] [2025-03-04 01:02:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475247923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:46,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:02:46,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225434598] [2025-03-04 01:02:46,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:46,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:02:46,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:02:46,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:02:46,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:02:46,693 INFO L87 Difference]: Start difference. First operand has 109 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:02:46,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:46,711 INFO L93 Difference]: Finished difference Result 208 states and 330 transitions. [2025-03-04 01:02:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:02:46,712 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2025-03-04 01:02:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:46,721 INFO L225 Difference]: With dead ends: 208 [2025-03-04 01:02:46,721 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 01:02:46,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:02:46,725 INFO L435 NwaCegarLoop]: 147 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, 147 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:46,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:02:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 01:02:46,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-04 01:02:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:02:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2025-03-04 01:02:46,757 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 157 [2025-03-04 01:02:46,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:46,757 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2025-03-04 01:02:46,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:02:46,757 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2025-03-04 01:02:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:02:46,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:46,761 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:46,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:02:46,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:02:46,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash 681947474, now seen corresponding path program 1 times [2025-03-04 01:02:46,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:02:46,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814428456] [2025-03-04 01:02:46,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:46,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-04 01:02:46,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:02:46,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:02:46,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 (3)] Waiting until timeout for monitored process [2025-03-04 01:02:47,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:02:47,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:02:47,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:47,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:47,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:02:47,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-04 01:02:47,456 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:47,456 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:02:47,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814428456] [2025-03-04 01:02:47,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814428456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:47,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:02:47,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:02:47,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097713252] [2025-03-04 01:02:47,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:47,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:02:47,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:02:47,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:02:47,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:02:47,458 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:02:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:02:47,536 INFO L93 Difference]: Finished difference Result 203 states and 294 transitions. [2025-03-04 01:02:47,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:02:47,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2025-03-04 01:02:47,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:02:47,539 INFO L225 Difference]: With dead ends: 203 [2025-03-04 01:02:47,539 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 01:02:47,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:02:47,541 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:02:47,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:02:47,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 01:02:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 01:02:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 01:02:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2025-03-04 01:02:47,558 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 157 [2025-03-04 01:02:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:02:47,558 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2025-03-04 01:02:47,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:02:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2025-03-04 01:02:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:02:47,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:02:47,560 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:02:47,576 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 (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:02:47,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:02:47,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:02:47,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:02:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash 974333299, now seen corresponding path program 1 times [2025-03-04 01:02:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:02:47,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353918252] [2025-03-04 01:02:47,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:47,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:02:47,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:02:47,765 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:02:47,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:02:47,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:02:48,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:02:48,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:48,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:48,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:02:48,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:48,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:02:48,862 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 68 treesize of output 32 [2025-03-04 01:02:49,945 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 113 treesize of output 65 [2025-03-04 01:02:50,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:50,146 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 191 treesize of output 77 [2025-03-04 01:02:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-04 01:02:50,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:02:50,440 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:02:50,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353918252] [2025-03-04 01:02:50,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353918252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:02:50,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [783117089] [2025-03-04 01:02:50,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:02:50,441 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:02:50,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:02:50,443 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:02:50,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-04 01:02:50,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:02:52,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:02:52,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:02:52,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:02:52,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 01:02:52,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:02:52,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:02:53,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2025-03-04 01:02:56,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:02:56,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 90 [2025-03-04 01:02:57,842 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 01:02:57,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:02:57,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [783117089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:02:57,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:02:57,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 20 [2025-03-04 01:02:57,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514425251] [2025-03-04 01:02:57,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:02:57,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:02:57,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:02:57,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:02:57,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:02:57,854 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 01:03:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:05,477 INFO L93 Difference]: Finished difference Result 392 states and 562 transitions. [2025-03-04 01:03:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:03:05,478 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 157 [2025-03-04 01:03:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:05,480 INFO L225 Difference]: With dead ends: 392 [2025-03-04 01:03:05,480 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 01:03:05,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2025-03-04 01:03:05,484 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 326 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:05,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 926 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2025-03-04 01:03:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 01:03:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 285. [2025-03-04 01:03:05,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 218 states have (on average 1.31651376146789) internal successors, (287), 220 states have internal predecessors, (287), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:03:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 411 transitions. [2025-03-04 01:03:05,526 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 411 transitions. Word has length 157 [2025-03-04 01:03:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:05,527 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 411 transitions. [2025-03-04 01:03:05,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-04 01:03:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 411 transitions. [2025-03-04 01:03:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-04 01:03:05,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:05,532 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:05,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:03:05,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-04 01:03:05,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:03:05,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:05,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash 333247156, now seen corresponding path program 1 times [2025-03-04 01:03:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:05,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1383630896] [2025-03-04 01:03:05,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:05,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:05,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:05,939 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:05,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:03:06,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-04 01:03:06,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-04 01:03:06,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:06,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:06,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:03:06,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-04 01:03:06,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:06,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:06,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1383630896] [2025-03-04 01:03:06,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1383630896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:06,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:06,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:03:06,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137743773] [2025-03-04 01:03:06,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:06,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:03:06,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:06,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:03:06,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:03:06,331 INFO L87 Difference]: Start difference. First operand 285 states and 411 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:03:06,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:06,389 INFO L93 Difference]: Finished difference Result 569 states and 822 transitions. [2025-03-04 01:03:06,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:03:06,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2025-03-04 01:03:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:06,393 INFO L225 Difference]: With dead ends: 569 [2025-03-04 01:03:06,393 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 01:03:06,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:03:06,394 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:06,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 427 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:06,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 01:03:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2025-03-04 01:03:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 220 states have (on average 1.309090909090909) internal successors, (288), 222 states have internal predecessors, (288), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:03:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 412 transitions. [2025-03-04 01:03:06,420 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 412 transitions. Word has length 157 [2025-03-04 01:03:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:06,420 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 412 transitions. [2025-03-04 01:03:06,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 01:03:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 412 transitions. [2025-03-04 01:03:06,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:03:06,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:06,422 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:06,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:03:06,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:06,623 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:06,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:06,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1911533780, now seen corresponding path program 1 times [2025-03-04 01:03:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986214244] [2025-03-04 01:03:06,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:06,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:06,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:06,626 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:06,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:03:06,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:03:06,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:03:06,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:06,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:07,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:03:07,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:07,146 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 79 treesize of output 43 [2025-03-04 01:03:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 320 proven. 16 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 01:03:07,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:07,410 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 49 treesize of output 25 [2025-03-04 01:03:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-03-04 01:03:07,435 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:07,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986214244] [2025-03-04 01:03:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986214244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:03:07,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:03:07,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-04 01:03:07,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553906364] [2025-03-04 01:03:07,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:03:07,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:03:07,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:07,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:03:07,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:03:07,437 INFO L87 Difference]: Start difference. First operand 287 states and 412 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2025-03-04 01:03:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:11,230 INFO L93 Difference]: Finished difference Result 588 states and 840 transitions. [2025-03-04 01:03:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:03:11,249 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) Word has length 159 [2025-03-04 01:03:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:11,251 INFO L225 Difference]: With dead ends: 588 [2025-03-04 01:03:11,251 INFO L226 Difference]: Without dead ends: 293 [2025-03-04 01:03:11,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:03:11,252 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 120 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:11,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 659 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-03-04 01:03:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-03-04 01:03:11,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 285. [2025-03-04 01:03:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 218 states have (on average 1.3027522935779816) internal successors, (284), 220 states have internal predecessors, (284), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:03:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 408 transitions. [2025-03-04 01:03:11,272 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 408 transitions. Word has length 159 [2025-03-04 01:03:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:11,272 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 408 transitions. [2025-03-04 01:03:11,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 12 states have internal predecessors, (81), 4 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (41), 3 states have call predecessors, (41), 4 states have call successors, (41) [2025-03-04 01:03:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 408 transitions. [2025-03-04 01:03:11,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:03:11,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:11,274 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:11,287 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-04 01:03:11,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:11,475 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:11,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash -573529931, now seen corresponding path program 1 times [2025-03-04 01:03:11,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:11,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813838015] [2025-03-04 01:03:11,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:11,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:11,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:11,478 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:11,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:03:11,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:03:11,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:03:11,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:11,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:12,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:03:12,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:12,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:03:12,314 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 66 treesize of output 30 [2025-03-04 01:03:12,971 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 111 treesize of output 63 [2025-03-04 01:03:13,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:13,105 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 189 treesize of output 75 [2025-03-04 01:03:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 01:03:13,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:13,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:13,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813838015] [2025-03-04 01:03:13,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813838015] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:13,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1090213224] [2025-03-04 01:03:13,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:13,316 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:03:13,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:03:13,318 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:03:13,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-04 01:03:13,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:03:15,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:03:15,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:15,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:15,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 01:03:15,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:15,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:03:16,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 30 [2025-03-04 01:03:17,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:17,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 76 [2025-03-04 01:03:18,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:18,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 87 [2025-03-04 01:03:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 16 proven. 320 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2025-03-04 01:03:18,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1090213224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:18,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:03:18,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 24 [2025-03-04 01:03:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284285963] [2025-03-04 01:03:18,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:03:18,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 01:03:18,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:18,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 01:03:18,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:03:18,200 INFO L87 Difference]: Start difference. First operand 285 states and 408 transitions. Second operand has 25 states, 23 states have (on average 5.130434782608695) internal successors, (118), 22 states have internal predecessors, (118), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 6 states have call successors, (42) [2025-03-04 01:03:30,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:03:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:31,801 INFO L93 Difference]: Finished difference Result 691 states and 977 transitions. [2025-03-04 01:03:31,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 01:03:31,802 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 5.130434782608695) internal successors, (118), 22 states have internal predecessors, (118), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 6 states have call successors, (42) Word has length 159 [2025-03-04 01:03:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:31,806 INFO L225 Difference]: With dead ends: 691 [2025-03-04 01:03:31,807 INFO L226 Difference]: Without dead ends: 409 [2025-03-04 01:03:31,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 333 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=472, Invalid=1978, Unknown=0, NotChecked=0, Total=2450 [2025-03-04 01:03:31,808 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 434 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:31,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1582 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2025-03-04 01:03:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-04 01:03:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 304. [2025-03-04 01:03:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 219 states have (on average 1.2511415525114156) internal successors, (274), 222 states have internal predecessors, (274), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 01:03:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 430 transitions. [2025-03-04 01:03:31,840 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 430 transitions. Word has length 159 [2025-03-04 01:03:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:31,841 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 430 transitions. [2025-03-04 01:03:31,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 5.130434782608695) internal successors, (118), 22 states have internal predecessors, (118), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 6 states have call successors, (42) [2025-03-04 01:03:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 430 transitions. [2025-03-04 01:03:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:03:31,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:31,845 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:31,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-03-04 01:03:32,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:03:32,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:32,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:32,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:32,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1913982902, now seen corresponding path program 1 times [2025-03-04 01:03:32,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:32,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493723849] [2025-03-04 01:03:32,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:32,246 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:32,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:32,248 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:32,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:03:32,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:03:32,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:03:32,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:32,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:32,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:03:32,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:03:32,643 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:32,643 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:32,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493723849] [2025-03-04 01:03:32,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493723849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:32,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:32,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:03:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129983923] [2025-03-04 01:03:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:32,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:03:32,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:32,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:03:32,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:03:32,644 INFO L87 Difference]: Start difference. First operand 304 states and 430 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:03:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:32,672 INFO L93 Difference]: Finished difference Result 596 states and 844 transitions. [2025-03-04 01:03:32,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:03:32,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2025-03-04 01:03:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:32,674 INFO L225 Difference]: With dead ends: 596 [2025-03-04 01:03:32,674 INFO L226 Difference]: Without dead ends: 304 [2025-03-04 01:03:32,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:03:32,675 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:32,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-04 01:03:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2025-03-04 01:03:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 219 states have (on average 1.2374429223744292) internal successors, (271), 222 states have internal predecessors, (271), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-04 01:03:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 427 transitions. [2025-03-04 01:03:32,689 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 427 transitions. Word has length 159 [2025-03-04 01:03:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:32,689 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 427 transitions. [2025-03-04 01:03:32,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:03:32,689 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 427 transitions. [2025-03-04 01:03:32,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-04 01:03:32,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:32,691 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:32,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:03:32,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:32,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:32,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:32,892 INFO L85 PathProgramCache]: Analyzing trace with hash -5006159, now seen corresponding path program 1 times [2025-03-04 01:03:32,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:32,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102221261] [2025-03-04 01:03:32,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:32,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:32,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:32,894 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:32,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:03:32,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:03:33,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:03:33,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:33,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:33,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 01:03:33,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:33,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:03:33,642 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 68 treesize of output 32 [2025-03-04 01:03:34,340 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 113 treesize of output 65 [2025-03-04 01:03:34,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:34,462 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 191 treesize of output 77 [2025-03-04 01:03:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-04 01:03:34,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:34,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:34,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102221261] [2025-03-04 01:03:34,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102221261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:34,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [754039832] [2025-03-04 01:03:34,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:34,666 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:03:34,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:03:34,668 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:03:34,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-04 01:03:34,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 01:03:36,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 01:03:36,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:36,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:36,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 01:03:36,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:37,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 01:03:37,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 32 [2025-03-04 01:03:39,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:39,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 77 [2025-03-04 01:03:39,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:39,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 88 [2025-03-04 01:03:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 31 proven. 365 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-04 01:03:39,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:03:39,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [754039832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:03:39,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:03:39,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 21 [2025-03-04 01:03:39,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755491933] [2025-03-04 01:03:39,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:03:39,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:03:39,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:39,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:03:39,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:03:39,992 INFO L87 Difference]: Start difference. First operand 304 states and 427 transitions. Second operand has 22 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 6 states have call successors, (42) [2025-03-04 01:03:46,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:03:52,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:03:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:54,232 INFO L93 Difference]: Finished difference Result 740 states and 1029 transitions. [2025-03-04 01:03:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 01:03:54,233 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 6 states have call successors, (42) Word has length 159 [2025-03-04 01:03:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:54,235 INFO L225 Difference]: With dead ends: 740 [2025-03-04 01:03:54,235 INFO L226 Difference]: Without dead ends: 448 [2025-03-04 01:03:54,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=405, Invalid=1757, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 01:03:54,238 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 748 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:54,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 1297 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2025-03-04 01:03:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-04 01:03:54,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 280. [2025-03-04 01:03:54,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 182 states have (on average 1.1538461538461537) internal successors, (210), 186 states have internal predecessors, (210), 90 states have call successors, (90), 7 states have call predecessors, (90), 7 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 01:03:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 390 transitions. [2025-03-04 01:03:54,264 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 390 transitions. Word has length 159 [2025-03-04 01:03:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:54,265 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 390 transitions. [2025-03-04 01:03:54,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 6 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 5 states have call predecessors, (42), 6 states have call successors, (42) [2025-03-04 01:03:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 390 transitions. [2025-03-04 01:03:54,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-04 01:03:54,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:54,266 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:54,285 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 (11)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:54,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:54,667 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-04 01:03:54,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:54,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1132631559, now seen corresponding path program 1 times [2025-03-04 01:03:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255317825] [2025-03-04 01:03:54,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:54,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:54,670 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:54,671 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 (13)] Waiting until timeout for monitored process [2025-03-04 01:03:54,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-04 01:03:55,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-04 01:03:55,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:55,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:55,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:03:55,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:03:55,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:55,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:55,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255317825] [2025-03-04 01:03:55,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255317825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:55,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:55,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:03:55,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160584999] [2025-03-04 01:03:55,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:55,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:03:55,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:55,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:03:55,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:03:55,209 INFO L87 Difference]: Start difference. First operand 280 states and 390 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:03:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:55,261 INFO L93 Difference]: Finished difference Result 551 states and 768 transitions. [2025-03-04 01:03:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:03:55,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2025-03-04 01:03:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:55,263 INFO L225 Difference]: With dead ends: 551 [2025-03-04 01:03:55,263 INFO L226 Difference]: Without dead ends: 283 [2025-03-04 01:03:55,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 157 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-04 01:03:55,264 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:55,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 545 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:03:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-04 01:03:55,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-04 01:03:55,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 185 states have (on average 1.1513513513513514) internal successors, (213), 189 states have internal predecessors, (213), 90 states have call successors, (90), 7 states have call predecessors, (90), 7 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-04 01:03:55,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 393 transitions. [2025-03-04 01:03:55,278 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 393 transitions. Word has length 161 [2025-03-04 01:03:55,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:55,278 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 393 transitions. [2025-03-04 01:03:55,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:03:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 393 transitions. [2025-03-04 01:03:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-04 01:03:55,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:55,280 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:55,296 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 (13)] Ended with exit code 0 [2025-03-04 01:03:55,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:55,480 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:55,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1177578111, now seen corresponding path program 1 times [2025-03-04 01:03:55,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:55,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872379522] [2025-03-04 01:03:55,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:55,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:55,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:55,484 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:55,485 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 (14)] Waiting until timeout for monitored process [2025-03-04 01:03:55,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-04 01:03:55,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-04 01:03:55,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:55,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:55,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:03:55,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:55,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:03:56,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2025-03-04 01:03:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:03:56,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:56,109 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:56,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872379522] [2025-03-04 01:03:56,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872379522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:56,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:56,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:03:56,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610123280] [2025-03-04 01:03:56,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:56,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:03:56,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:56,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:03:56,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:03:56,111 INFO L87 Difference]: Start difference. First operand 283 states and 393 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:03:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:03:56,412 INFO L93 Difference]: Finished difference Result 560 states and 776 transitions. [2025-03-04 01:03:56,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:03:56,413 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2025-03-04 01:03:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:03:56,415 INFO L225 Difference]: With dead ends: 560 [2025-03-04 01:03:56,416 INFO L226 Difference]: Without dead ends: 558 [2025-03-04 01:03:56,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:03:56,416 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 127 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:03:56,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1199 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:03:56,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-03-04 01:03:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 521. [2025-03-04 01:03:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 347 states have (on average 1.1613832853025936) internal successors, (403), 353 states have internal predecessors, (403), 160 states have call successors, (160), 13 states have call predecessors, (160), 13 states have return successors, (160), 154 states have call predecessors, (160), 160 states have call successors, (160) [2025-03-04 01:03:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 723 transitions. [2025-03-04 01:03:56,441 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 723 transitions. Word has length 163 [2025-03-04 01:03:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:03:56,441 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 723 transitions. [2025-03-04 01:03:56,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:03:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 723 transitions. [2025-03-04 01:03:56,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-04 01:03:56,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:03:56,443 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:03:56,458 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 (14)] Forceful destruction successful, exit code 0 [2025-03-04 01:03:56,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:56,644 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:03:56,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:03:56,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1190163792, now seen corresponding path program 1 times [2025-03-04 01:03:56,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:03:56,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505130812] [2025-03-04 01:03:56,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:03:56,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:03:56,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:03:56,648 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:03:56,649 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 (15)] Waiting until timeout for monitored process [2025-03-04 01:03:56,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-04 01:03:57,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-04 01:03:57,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:03:57,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:03:57,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:03:57,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:03:57,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:03:57,344 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 40 treesize of output 16 [2025-03-04 01:03:57,617 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 01:03:57,617 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:03:57,617 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:03:57,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505130812] [2025-03-04 01:03:57,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505130812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:03:57,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:03:57,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:03:57,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811794331] [2025-03-04 01:03:57,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:03:57,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:03:57,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:03:57,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:03:57,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:03:57,618 INFO L87 Difference]: Start difference. First operand 521 states and 723 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:04:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:04:00,430 INFO L93 Difference]: Finished difference Result 1249 states and 1709 transitions. [2025-03-04 01:04:00,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:04:00,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2025-03-04 01:04:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:04:00,435 INFO L225 Difference]: With dead ends: 1249 [2025-03-04 01:04:00,435 INFO L226 Difference]: Without dead ends: 740 [2025-03-04 01:04:00,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 160 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-04 01:04:00,437 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 78 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:04:00,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 714 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 01:04:00,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2025-03-04 01:04:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 729. [2025-03-04 01:04:00,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 499 states have (on average 1.1663326653306614) internal successors, (582), 513 states have internal predecessors, (582), 204 states have call successors, (204), 25 states have call predecessors, (204), 25 states have return successors, (204), 190 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-04 01:04:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 990 transitions. [2025-03-04 01:04:00,490 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 990 transitions. Word has length 164 [2025-03-04 01:04:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:04:00,490 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 990 transitions. [2025-03-04 01:04:00,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 01:04:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 990 transitions. [2025-03-04 01:04:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 01:04:00,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:04:00,491 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:04:00,507 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 (15)] Ended with exit code 0 [2025-03-04 01:04:00,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:04:00,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:04:00,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:04:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1907517922, now seen corresponding path program 1 times [2025-03-04 01:04:00,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:04:00,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730605591] [2025-03-04 01:04:00,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:04:00,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:04:00,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:04:00,696 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:04:00,697 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 (16)] Waiting until timeout for monitored process [2025-03-04 01:04:00,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes.