./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.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-s_file-47.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 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:40:17,919 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:40:17,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:40:17,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:40:17,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:40:17,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:40:17,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:40:17,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:40:17,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:40:17,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:40:17,993 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:40:17,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:40:17,993 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:40:17,994 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:40:17,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:40:17,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:40:17,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:40:17,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:40:17,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:40:17,996 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 -> 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 [2025-03-04 01:40:18,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:40:18,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:40:18,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:40:18,231 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:40:18,232 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:40:18,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2025-03-04 01:40:19,417 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10b981b5/2964de218f7744e4a4684db9c1de3ac6/FLAGd8015931f [2025-03-04 01:40:19,623 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:40:19,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2025-03-04 01:40:19,631 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10b981b5/2964de218f7744e4a4684db9c1de3ac6/FLAGd8015931f [2025-03-04 01:40:19,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10b981b5/2964de218f7744e4a4684db9c1de3ac6 [2025-03-04 01:40:19,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:40:19,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:40:19,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:40:19,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:40:19,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:40:19,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f99ca09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19, skipping insertion in model container [2025-03-04 01:40:19,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,668 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:40:19,761 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-s_file-47.i[916,929] [2025-03-04 01:40:19,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:40:19,811 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:40:19,819 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-s_file-47.i[916,929] [2025-03-04 01:40:19,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:40:19,855 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:40:19,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19 WrapperNode [2025-03-04 01:40:19,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:40:19,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:40:19,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:40:19,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:40:19,860 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:40:19" (1/1) ... [2025-03-04 01:40:19,873 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:40:19" (1/1) ... [2025-03-04 01:40:19,897 INFO L138 Inliner]: procedures = 29, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 448 [2025-03-04 01:40:19,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:40:19,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:40:19,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:40:19,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:40:19,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,907 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,919 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2025-03-04 01:40:19,920 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,920 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,933 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,934 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,935 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,940 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:40:19,950 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:40:19,950 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:40:19,951 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:40:19,952 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (1/1) ... [2025-03-04 01:40:19,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:40:19,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:19,974 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:40:19,976 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:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:40:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:40:19,991 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:40:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:40:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:40:19,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:40:19,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:40:20,082 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:40:20,084 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:40:20,402 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite85#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~short98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short101#1;havoc property_#t~ite123#1;havoc property_#t~mem102#1;havoc property_#t~ite122#1;havoc property_#t~mem119#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-04 01:40:20,427 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-03-04 01:40:20,427 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:40:20,435 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:40:20,436 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:40:20,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:20 BoogieIcfgContainer [2025-03-04 01:40:20,437 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:40:20,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:40:20,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:40:20,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:40:20,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:40:19" (1/3) ... [2025-03-04 01:40:20,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1013369b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:40:20, skipping insertion in model container [2025-03-04 01:40:20,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:19" (2/3) ... [2025-03-04 01:40:20,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1013369b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:40:20, skipping insertion in model container [2025-03-04 01:40:20,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:20" (3/3) ... [2025-03-04 01:40:20,445 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-47.i [2025-03-04 01:40:20,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:40:20,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-47.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:40:20,495 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:40:20,504 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;@6545c582, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:40:20,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:40:20,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:40:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:20,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:20,514 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:20,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:20,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:20,518 INFO L85 PathProgramCache]: Analyzing trace with hash -361994844, now seen corresponding path program 1 times [2025-03-04 01:40:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:20,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831501061] [2025-03-04 01:40:20,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:20,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:20,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:20,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:20,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 01:40:20,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:20,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831501061] [2025-03-04 01:40:20,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831501061] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:20,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799354167] [2025-03-04 01:40:20,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:20,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:20,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:20,723 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:40:20,724 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:40:20,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:20,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:20,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:20,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:20,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:40:20,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:20,893 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-03-04 01:40:20,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:20,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799354167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:20,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:20,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:40:20,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479920476] [2025-03-04 01:40:20,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:20,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:40:20,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:20,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:40:20,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:40:20,912 INFO L87 Difference]: Start difference. First operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:40:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:20,946 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-03-04 01:40:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:40:20,948 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-04 01:40:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:20,954 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:40:20,954 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 01:40:20,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 85 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:40:20,958 INFO L435 NwaCegarLoop]: 134 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, 134 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:40:20,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:20,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 01:40:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 01:40:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:40:20,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-03-04 01:40:20,984 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2025-03-04 01:40:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:20,985 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-03-04 01:40:20,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:40:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-03-04 01:40:20,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:20,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:20,987 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:20,994 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:40:21,191 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:40:21,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:21,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:21,192 INFO L85 PathProgramCache]: Analyzing trace with hash -692953925, now seen corresponding path program 1 times [2025-03-04 01:40:21,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:21,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709155925] [2025-03-04 01:40:21,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:21,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:21,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:21,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:21,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:21,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:21,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:21,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709155925] [2025-03-04 01:40:21,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709155925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:21,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:21,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:40:21,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026480112] [2025-03-04 01:40:21,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:21,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:21,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:21,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:21,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:40:21,398 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:21,428 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2025-03-04 01:40:21,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:21,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:40:21,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:21,434 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:40:21,434 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 01:40:21,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:40:21,436 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:21,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 384 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 01:40:21,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2025-03-04 01:40:21,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:40:21,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2025-03-04 01:40:21,449 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 84 [2025-03-04 01:40:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:21,450 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2025-03-04 01:40:21,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:21,450 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2025-03-04 01:40:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:21,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:21,451 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:21,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:40:21,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:21,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:21,454 INFO L85 PathProgramCache]: Analyzing trace with hash -692030404, now seen corresponding path program 1 times [2025-03-04 01:40:21,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:21,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960364951] [2025-03-04 01:40:21,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:21,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:21,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:21,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:21,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:21,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:21,811 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:21,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:21,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960364951] [2025-03-04 01:40:21,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960364951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:21,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:21,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:21,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034247725] [2025-03-04 01:40:21,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:21,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:21,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:21,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:21,814 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:22,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:22,161 INFO L93 Difference]: Finished difference Result 274 states and 399 transitions. [2025-03-04 01:40:22,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:40:22,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:40:22,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:22,163 INFO L225 Difference]: With dead ends: 274 [2025-03-04 01:40:22,163 INFO L226 Difference]: Without dead ends: 183 [2025-03-04 01:40:22,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:22,164 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 115 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:22,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 302 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:40:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-04 01:40:22,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 171. [2025-03-04 01:40:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.4066666666666667) internal successors, (211), 150 states have internal predecessors, (211), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:40:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 247 transitions. [2025-03-04 01:40:22,186 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 247 transitions. Word has length 84 [2025-03-04 01:40:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:22,187 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 247 transitions. [2025-03-04 01:40:22,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2025-03-04 01:40:22,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:22,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:22,189 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:22,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:40:22,189 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:22,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash -562947685, now seen corresponding path program 1 times [2025-03-04 01:40:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406349865] [2025-03-04 01:40:22,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:22,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:22,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:22,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:22,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:40:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406349865] [2025-03-04 01:40:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406349865] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104589538] [2025-03-04 01:40:22,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:22,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:22,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:22,376 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:40:22,378 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:40:22,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:22,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:22,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:22,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:22,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:40:22,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:22,536 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:22,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:22,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104589538] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:22,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:22,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:40:22,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155950216] [2025-03-04 01:40:22,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:22,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:22,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:22,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:22,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:40:22,540 INFO L87 Difference]: Start difference. First operand 171 states and 247 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:22,570 INFO L93 Difference]: Finished difference Result 344 states and 498 transitions. [2025-03-04 01:40:22,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:22,571 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:40:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:22,572 INFO L225 Difference]: With dead ends: 344 [2025-03-04 01:40:22,572 INFO L226 Difference]: Without dead ends: 176 [2025-03-04 01:40:22,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:40:22,575 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 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:40:22,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-04 01:40:22,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-03-04 01:40:22,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 155 states have (on average 1.3935483870967742) internal successors, (216), 155 states have internal predecessors, (216), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:40:22,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 252 transitions. [2025-03-04 01:40:22,589 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 252 transitions. Word has length 84 [2025-03-04 01:40:22,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:22,590 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 252 transitions. [2025-03-04 01:40:22,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:22,590 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 252 transitions. [2025-03-04 01:40:22,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:22,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:22,591 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:22,598 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:40:22,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 01:40:22,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:22,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:22,795 INFO L85 PathProgramCache]: Analyzing trace with hash -211908908, now seen corresponding path program 1 times [2025-03-04 01:40:22,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:22,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940412903] [2025-03-04 01:40:22,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:22,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:22,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:22,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:22,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:22,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:40:22,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:40:22,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940412903] [2025-03-04 01:40:22,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940412903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:22,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218398966] [2025-03-04 01:40:22,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:22,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:22,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:22,924 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:40:22,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:40:23,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:23,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:23,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:23,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:23,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:40:23,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:23,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:23,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218398966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:23,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:23,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:40:23,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264326297] [2025-03-04 01:40:23,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:23,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:23,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:40:23,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:23,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:40:23,097 INFO L87 Difference]: Start difference. First operand 176 states and 252 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:23,122 INFO L93 Difference]: Finished difference Result 355 states and 509 transitions. [2025-03-04 01:40:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:40:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:23,124 INFO L225 Difference]: With dead ends: 355 [2025-03-04 01:40:23,124 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 01:40:23,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:40:23,125 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:23,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 01:40:23,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2025-03-04 01:40:23,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.3885350318471337) internal successors, (218), 157 states have internal predecessors, (218), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:40:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 254 transitions. [2025-03-04 01:40:23,137 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 254 transitions. Word has length 84 [2025-03-04 01:40:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:23,138 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 254 transitions. [2025-03-04 01:40:23,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2025-03-04 01:40:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:23,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:23,139 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:23,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:40:23,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:40:23,340 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:23,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash 791470683, now seen corresponding path program 1 times [2025-03-04 01:40:23,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:40:23,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456577577] [2025-03-04 01:40:23,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:40:23,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:23,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:23,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:23,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:40:23,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:40:23,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:23,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:23,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:23,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:40:23,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:40:23,471 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:40:23,472 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:40:23,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:40:23,475 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-04 01:40:23,517 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:40:23,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:40:23 BoogieIcfgContainer [2025-03-04 01:40:23,519 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:40:23,520 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:40:23,520 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:40:23,520 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:40:23,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:20" (3/4) ... [2025-03-04 01:40:23,522 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:40:23,522 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:40:23,523 INFO L158 Benchmark]: Toolchain (without parser) took 3875.31ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 103.6MB in the end (delta: 28.3MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2025-03-04 01:40:23,523 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:23,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.88ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 117.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:40:23,523 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.66ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 114.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:23,523 INFO L158 Benchmark]: Boogie Preprocessor took 44.22ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 110.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:23,523 INFO L158 Benchmark]: IcfgBuilder took 487.25ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 83.2MB in the end (delta: 27.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:40:23,524 INFO L158 Benchmark]: TraceAbstraction took 3080.25ms. Allocated memory is still 167.8MB. Free memory was 82.8MB in the beginning and 103.6MB in the end (delta: -20.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:23,524 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 103.6MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:40:23,526 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.88ms. Allocated memory is still 167.8MB. Free memory was 131.9MB in the beginning and 117.2MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.66ms. Allocated memory is still 167.8MB. Free memory was 117.2MB in the beginning and 114.5MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.22ms. Allocated memory is still 167.8MB. Free memory was 114.5MB in the beginning and 110.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 487.25ms. Allocated memory is still 167.8MB. Free memory was 110.9MB in the beginning and 83.2MB in the end (delta: 27.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3080.25ms. Allocated memory is still 167.8MB. Free memory was 82.8MB in the beginning and 103.6MB in the end (delta: -20.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 167.8MB. Free memory was 103.6MB in the beginning and 103.6MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 24.575, 3.5, 16, 16, 4, 8, 1, 1, 3.8 }; [L45] signed long int last_1_WrapperStruct0_var_1_12 = 8; VAL [WrapperStruct0={4:0}, isInitial=0, last_1_WrapperStruct0_var_1_12=8] [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] EXPR WrapperStruct0.var_1_12 [L92] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L76] WrapperStruct0.var_1_8 = __VERIFIER_nondet_double() [L77] EXPR WrapperStruct0.var_1_8 [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F [L77] EXPR WrapperStruct0.var_1_8 [L77] EXPR WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] EXPR (WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] CALL assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L77] RET assume_abort_if_not((WrapperStruct0.var_1_8 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_8 <= -1.0e-20F) || (WrapperStruct0.var_1_8 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L78] WrapperStruct0.var_1_10 = __VERIFIER_nondet_char() [L79] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] CALL assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L79] RET assume_abort_if_not(WrapperStruct0.var_1_10 >= -63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] EXPR WrapperStruct0.var_1_10 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] CALL assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L80] RET assume_abort_if_not(WrapperStruct0.var_1_10 <= 63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L81] WrapperStruct0.var_1_11 = __VERIFIER_nondet_char() [L82] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L82] CALL assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L82] RET assume_abort_if_not(WrapperStruct0.var_1_11 >= -63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] EXPR WrapperStruct0.var_1_11 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] CALL assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L83] RET assume_abort_if_not(WrapperStruct0.var_1_11 <= 63) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L84] WrapperStruct0.var_1_13 = __VERIFIER_nondet_uchar() [L85] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L85] CALL assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L85] RET assume_abort_if_not(WrapperStruct0.var_1_13 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] EXPR WrapperStruct0.var_1_13 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] CALL assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L86] RET assume_abort_if_not(WrapperStruct0.var_1_13 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L87] WrapperStruct0.var_1_14 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] CALL assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L88] RET assume_abort_if_not(WrapperStruct0.var_1_14 >= 0) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] EXPR WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_14 <= 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L103] RET updateVariables() [L104] CALL step() [L49] COND FALSE !(-4 > last_1_WrapperStruct0_var_1_12) [L54] EXPR WrapperStruct0.var_1_10 [L54] WrapperStruct0.var_1_9 = WrapperStruct0.var_1_10 [L56] EXPR WrapperStruct0.var_1_13 [L56] unsigned char stepLocal_0 = ! WrapperStruct0.var_1_13; [L57] stepLocal_0 || WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L57] stepLocal_0 || WrapperStruct0.var_1_14 [L57] EXPR WrapperStruct0.var_1_14 [L57] stepLocal_0 || WrapperStruct0.var_1_14 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L57] COND FALSE !(stepLocal_0 || WrapperStruct0.var_1_14) [L64] EXPR WrapperStruct0.var_1_8 [L64] WrapperStruct0.var_1_15 = WrapperStruct0.var_1_8 [L65] EXPR WrapperStruct0.var_1_15 [L65] EXPR WrapperStruct0.var_1_15 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L65] COND FALSE !(WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) [L70] EXPR WrapperStruct0.var_1_12 [L70] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L70] COND TRUE WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9 [L71] EXPR WrapperStruct0.var_1_8 [L71] WrapperStruct0.var_1_1 = WrapperStruct0.var_1_8 [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR WrapperStruct0.var_1_15 [L95] EXPR WrapperStruct0.var_1_15 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1) [L95] EXPR WrapperStruct0.var_1_12 [L95] EXPR WrapperStruct0.var_1_9 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1 [L95] EXPR WrapperStruct0.var_1_1 [L95] EXPR WrapperStruct0.var_1_8 [L95] EXPR (WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1 VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10))) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR (((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95] EXPR ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L95-L96] return ((((WrapperStruct0.var_1_15 <= WrapperStruct0.var_1_15) ? (((WrapperStruct0.var_1_12 + WrapperStruct0.var_1_12) >= (WrapperStruct0.var_1_12 + WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_1 == ((double) ((((WrapperStruct0.var_1_8) < 0 ) ? -(WrapperStruct0.var_1_8) : (WrapperStruct0.var_1_8))))) : 1) : ((WrapperStruct0.var_1_12 > WrapperStruct0.var_1_9) ? (WrapperStruct0.var_1_1 == ((double) WrapperStruct0.var_1_8)) : 1)) && ((-4 > last_1_WrapperStruct0_var_1_12) ? (((~ last_1_WrapperStruct0_var_1_12) <= last_1_WrapperStruct0_var_1_12) ? (WrapperStruct0.var_1_9 == ((signed char) ((((WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) < 0 ) ? -(WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11) : (WrapperStruct0.var_1_10 + WrapperStruct0.var_1_11))))) : 1) : (WrapperStruct0.var_1_9 == ((signed char) WrapperStruct0.var_1_10)))) && (((! WrapperStruct0.var_1_13) || WrapperStruct0.var_1_14) ? ((! WrapperStruct0.var_1_14) ? (WrapperStruct0.var_1_12 == ((signed long int) (((((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) < 0 ) ? -((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))) : ((((WrapperStruct0.var_1_9) < (WrapperStruct0.var_1_9)) ? (WrapperStruct0.var_1_9) : (WrapperStruct0.var_1_9))))))) : (WrapperStruct0.var_1_12 == ((signed long int) WrapperStruct0.var_1_9))) : 1)) && (WrapperStruct0.var_1_15 == ((double) WrapperStruct0.var_1_8)) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] [L19] reach_error() VAL [WrapperStruct0={4:0}, isInitial=1, last_1_WrapperStruct0_var_1_12=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 1843 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1220 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 372 IncrementalHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 623 mSDtfsCounter, 372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=5, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 756 NumberOfCodeBlocks, 756 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 664 ConstructedInterpolants, 0 QuantifiedInterpolants, 762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 846 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 1118/1152 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:40:23,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.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 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:40:25,319 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:40:25,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:40:25,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:40:25,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:40:25,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:40:25,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:40:25,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:40:25,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:40:25,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:40:25,412 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:40:25,412 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:40:25,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:40:25,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:40:25,412 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:40:25,412 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:40:25,412 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:40:25,412 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:40:25,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:40:25,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:40:25,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:40:25,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:40:25,416 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 -> 2b982617b4eafec7cbb1a277d4cd75e5591003436ed1218fbd6f7cc65704fea2 [2025-03-04 01:40:25,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:40:25,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:40:25,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:40:25,657 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:40:25,657 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:40:25,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2025-03-04 01:40:26,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a69d9c0a/530047fa00da449fbce5462188bd91c6/FLAG9acc7fa3a [2025-03-04 01:40:27,025 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:40:27,025 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-47.i [2025-03-04 01:40:27,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a69d9c0a/530047fa00da449fbce5462188bd91c6/FLAG9acc7fa3a [2025-03-04 01:40:27,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a69d9c0a/530047fa00da449fbce5462188bd91c6 [2025-03-04 01:40:27,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:40:27,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:40:27,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:40:27,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:40:27,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:40:27,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25f4d520 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27, skipping insertion in model container [2025-03-04 01:40:27,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:40:27,190 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-s_file-47.i[916,929] [2025-03-04 01:40:27,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:40:27,249 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:40:27,257 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-s_file-47.i[916,929] [2025-03-04 01:40:27,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:40:27,306 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:40:27,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27 WrapperNode [2025-03-04 01:40:27,307 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:40:27,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:40:27,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:40:27,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:40:27,312 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:40:27" (1/1) ... [2025-03-04 01:40:27,327 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:40:27" (1/1) ... [2025-03-04 01:40:27,356 INFO L138 Inliner]: procedures = 33, calls = 136, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2025-03-04 01:40:27,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:40:27,356 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:40:27,356 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:40:27,356 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:40:27,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,378 INFO L175 MemorySlicer]: Split 115 memory accesses to 2 slices as follows [2, 113]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 12 writes are split as follows [0, 12]. [2025-03-04 01:40:27,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,395 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,398 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:40:27,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:40:27,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:40:27,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:40:27,407 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (1/1) ... [2025-03-04 01:40:27,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:40:27,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:40:27,435 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:40:27,441 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:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:40:27,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:40:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:40:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:40:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:40:27,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:40:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:40:27,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:40:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:40:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:40:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:40:27,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:40:27,529 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:40:27,531 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:40:28,012 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite85#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem74#1;havoc property_#t~ite77#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite97#1;havoc property_#t~ite94#1;havoc property_#t~mem93#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite92#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~short98#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~short101#1;havoc property_#t~ite123#1;havoc property_#t~mem102#1;havoc property_#t~ite122#1;havoc property_#t~mem119#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~ite118#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-04 01:40:28,054 INFO L? ?]: Removed 132 outVars from TransFormulas that were not future-live. [2025-03-04 01:40:28,054 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:40:28,065 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:40:28,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:40:28,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:28 BoogieIcfgContainer [2025-03-04 01:40:28,066 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:40:28,068 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:40:28,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:40:28,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:40:28,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:40:27" (1/3) ... [2025-03-04 01:40:28,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6145ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:40:28, skipping insertion in model container [2025-03-04 01:40:28,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:40:27" (2/3) ... [2025-03-04 01:40:28,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a6145ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:40:28, skipping insertion in model container [2025-03-04 01:40:28,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:40:28" (3/3) ... [2025-03-04 01:40:28,074 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-47.i [2025-03-04 01:40:28,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:40:28,085 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-47.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:40:28,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:40:28,132 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;@26d51efb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:40:28,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:40:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:40:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:28,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:28,146 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:28,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:28,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:28,150 INFO L85 PathProgramCache]: Analyzing trace with hash -361994844, now seen corresponding path program 1 times [2025-03-04 01:40:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:28,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657550570] [2025-03-04 01:40:28,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:28,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:40:28,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:28,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:40:28,164 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:40:28,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:28,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:28,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:28,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:28,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:40:28,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:28,400 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:40:28,400 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:28,400 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:28,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657550570] [2025-03-04 01:40:28,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657550570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:28,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:28,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:40:28,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426438476] [2025-03-04 01:40:28,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:28,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:40:28,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:28,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:40:28,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:40:28,419 INFO L87 Difference]: Start difference. First operand has 95 states, 83 states have (on average 1.4578313253012047) internal successors, (121), 84 states have internal predecessors, (121), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:40:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:28,441 INFO L93 Difference]: Finished difference Result 184 states and 282 transitions. [2025-03-04 01:40:28,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:40:28,443 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-04 01:40:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:28,449 INFO L225 Difference]: With dead ends: 184 [2025-03-04 01:40:28,449 INFO L226 Difference]: Without dead ends: 92 [2025-03-04 01:40:28,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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:40:28,455 INFO L435 NwaCegarLoop]: 134 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, 134 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:40:28,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:28,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-04 01:40:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-04 01:40:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 81 states have internal predecessors, (116), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:40:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2025-03-04 01:40:28,481 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 84 [2025-03-04 01:40:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:28,482 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2025-03-04 01:40:28,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:40:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2025-03-04 01:40:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:28,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:28,485 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:28,493 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:40:28,686 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:40:28,686 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:28,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash -692953925, now seen corresponding path program 1 times [2025-03-04 01:40:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:28,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303665186] [2025-03-04 01:40:28,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:28,687 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:40:28,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:28,689 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:40:28,691 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:40:28,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:28,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:28,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:28,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:28,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:40:28,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:28,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:28,921 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:28,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303665186] [2025-03-04 01:40:28,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303665186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:28,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:28,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:28,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285330352] [2025-03-04 01:40:28,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:28,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:28,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:28,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:28,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:28,925 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:29,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:29,037 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2025-03-04 01:40:29,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:29,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:40:29,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:29,039 INFO L225 Difference]: With dead ends: 186 [2025-03-04 01:40:29,039 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 01:40:29,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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:40:29,040 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:29,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 503 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:40:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 01:40:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-03-04 01:40:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:40:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-03-04 01:40:29,051 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 84 [2025-03-04 01:40:29,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:29,052 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-03-04 01:40:29,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-03-04 01:40:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:29,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:29,055 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:29,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 (3)] Ended with exit code 0 [2025-03-04 01:40:29,260 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:40:29,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:29,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:29,261 INFO L85 PathProgramCache]: Analyzing trace with hash -692030404, now seen corresponding path program 1 times [2025-03-04 01:40:29,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:29,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593556151] [2025-03-04 01:40:29,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:29,261 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:40:29,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:29,264 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:40:29,265 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:40:29,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:29,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:29,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:29,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:29,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:40:29,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:29,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:29,527 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 154 treesize of output 46 [2025-03-04 01:40:29,600 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:29,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:29,601 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:29,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593556151] [2025-03-04 01:40:29,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593556151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:29,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:29,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:29,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215994854] [2025-03-04 01:40:29,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:29,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:29,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:29,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:29,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:29,603 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:32,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:32,651 INFO L93 Difference]: Finished difference Result 275 states and 396 transitions. [2025-03-04 01:40:32,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:32,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:40:32,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:32,653 INFO L225 Difference]: With dead ends: 275 [2025-03-04 01:40:32,653 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 01:40:32,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:40:32,654 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 113 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:32,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 255 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-04 01:40:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 01:40:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 98. [2025-03-04 01:40:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 87 states have internal predecessors, (122), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:40:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-03-04 01:40:32,663 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 84 [2025-03-04 01:40:32,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:32,663 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-03-04 01:40:32,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-03-04 01:40:32,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:32,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:32,665 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:32,671 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:40:32,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:40:32,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:32,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash -211908908, now seen corresponding path program 1 times [2025-03-04 01:40:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:32,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106709031] [2025-03-04 01:40:32,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:32,867 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:40:32,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:32,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:40:32,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:40:32,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:32,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:32,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:32,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:32,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:40:32,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:33,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:33,022 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:33,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106709031] [2025-03-04 01:40:33,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106709031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:33,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:33,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:33,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645775301] [2025-03-04 01:40:33,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:33,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:33,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:33,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:33,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:33,024 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:33,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:33,054 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2025-03-04 01:40:33,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:33,054 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:40:33,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:33,055 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:40:33,055 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:40:33,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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:40:33,056 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 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:40:33,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:33,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:40:33,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 01:40:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 90 states have (on average 1.3888888888888888) internal successors, (125), 90 states have internal predecessors, (125), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 01:40:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-03-04 01:40:33,068 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 84 [2025-03-04 01:40:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:33,069 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-03-04 01:40:33,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:33,069 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-03-04 01:40:33,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:33,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:33,071 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:33,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:40:33,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:40:33,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:33,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:33,272 INFO L85 PathProgramCache]: Analyzing trace with hash 791470683, now seen corresponding path program 1 times [2025-03-04 01:40:33,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:33,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059524824] [2025-03-04 01:40:33,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:33,273 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:40:33,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:33,275 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:40:33,275 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:40:33,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:33,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:33,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:33,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:33,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:40:33,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:33,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:40:33,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:33,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 69 [2025-03-04 01:40:33,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:33,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-04 01:40:34,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:34,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-04 01:40:34,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:34,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-04 01:40:34,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:34,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-04 01:40:34,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:34,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 180 treesize of output 66 [2025-03-04 01:40:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:40:34,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:34,773 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059524824] [2025-03-04 01:40:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059524824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:34,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:34,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:40:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173952223] [2025-03-04 01:40:34,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:34,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:40:34,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:34,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:40:34,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:40:34,774 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:40:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:36,084 INFO L93 Difference]: Finished difference Result 293 states and 413 transitions. [2025-03-04 01:40:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:40:36,085 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 84 [2025-03-04 01:40:36,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:36,086 INFO L225 Difference]: With dead ends: 293 [2025-03-04 01:40:36,086 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 01:40:36,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:40:36,087 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 305 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:36,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 420 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:40:36,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 01:40:36,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 147. [2025-03-04 01:40:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 125 states have (on average 1.368) internal successors, (171), 125 states have internal predecessors, (171), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:40:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 207 transitions. [2025-03-04 01:40:36,098 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 207 transitions. Word has length 84 [2025-03-04 01:40:36,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:36,098 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 207 transitions. [2025-03-04 01:40:36,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:40:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 207 transitions. [2025-03-04 01:40:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 01:40:36,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:36,099 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:36,108 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:40:36,300 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:40:36,300 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:36,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash 911590556, now seen corresponding path program 1 times [2025-03-04 01:40:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:36,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272305136] [2025-03-04 01:40:36,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:36,301 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:40:36,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:36,303 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:40:36,305 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:40:36,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 01:40:36,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 01:40:36,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:36,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:36,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:40:36,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:36,453 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:36,453 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:36,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:36,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272305136] [2025-03-04 01:40:36,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272305136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:36,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:36,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:40:36,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709228882] [2025-03-04 01:40:36,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:36,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:36,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:36,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:36,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:40:36,455 INFO L87 Difference]: Start difference. First operand 147 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:36,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:36,495 INFO L93 Difference]: Finished difference Result 291 states and 411 transitions. [2025-03-04 01:40:36,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:36,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 84 [2025-03-04 01:40:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:36,496 INFO L225 Difference]: With dead ends: 291 [2025-03-04 01:40:36,496 INFO L226 Difference]: Without dead ends: 147 [2025-03-04 01:40:36,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 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:40:36,496 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:36,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 389 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:40:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-04 01:40:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-04 01:40:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 125 states have (on average 1.36) internal successors, (170), 125 states have internal predecessors, (170), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:40:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 206 transitions. [2025-03-04 01:40:36,507 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 206 transitions. Word has length 84 [2025-03-04 01:40:36,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:36,507 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 206 transitions. [2025-03-04 01:40:36,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 206 transitions. [2025-03-04 01:40:36,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 01:40:36,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:36,508 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:36,519 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:40:36,713 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:40:36,713 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:36,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:36,713 INFO L85 PathProgramCache]: Analyzing trace with hash -158299719, now seen corresponding path program 1 times [2025-03-04 01:40:36,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:36,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894910291] [2025-03-04 01:40:36,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:36,714 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:40:36,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:36,716 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:40:36,717 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:40:36,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:40:36,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:40:36,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:36,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:36,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:40:36,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:36,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:40:37,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:37,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 67 [2025-03-04 01:40:37,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:37,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 70 [2025-03-04 01:40:37,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:37,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 80 [2025-03-04 01:40:37,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:37,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 83 [2025-03-04 01:40:38,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:38,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 83 [2025-03-04 01:40:38,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:38,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 188 treesize of output 68 [2025-03-04 01:40:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-04 01:40:38,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:40:38,390 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:38,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894910291] [2025-03-04 01:40:38,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894910291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:38,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [165265315] [2025-03-04 01:40:38,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:38,390 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:40:38,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:40:38,408 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:40:38,409 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:40:38,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:40:39,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:40:39,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:39,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:39,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 01:40:39,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:39,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:40:44,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:44,630 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 118 treesize of output 61 [2025-03-04 01:40:44,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:44,828 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 115 treesize of output 69 [2025-03-04 01:40:45,128 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:45,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 78 [2025-03-04 01:40:45,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:45,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 78 [2025-03-04 01:40:45,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:45,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 78 [2025-03-04 01:40:45,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 115 [2025-03-04 01:40:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 24 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-04 01:40:46,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:40:46,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [165265315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:46,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:40:46,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2025-03-04 01:40:46,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139391138] [2025-03-04 01:40:46,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:40:46,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 01:40:46,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:46,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 01:40:46,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=689, Unknown=1, NotChecked=0, Total=812 [2025-03-04 01:40:46,694 INFO L87 Difference]: Start difference. First operand 147 states and 206 transitions. Second operand has 24 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 20 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:40:50,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:50,685 INFO L93 Difference]: Finished difference Result 394 states and 545 transitions. [2025-03-04 01:40:50,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 01:40:50,686 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 20 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) Word has length 86 [2025-03-04 01:40:50,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:50,687 INFO L225 Difference]: With dead ends: 394 [2025-03-04 01:40:50,687 INFO L226 Difference]: Without dead ends: 250 [2025-03-04 01:40:50,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 187 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=395, Invalid=1674, Unknown=1, NotChecked=0, Total=2070 [2025-03-04 01:40:50,688 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 633 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:50,689 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 686 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 01:40:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-04 01:40:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 181. [2025-03-04 01:40:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 146 states have (on average 1.3082191780821917) internal successors, (191), 147 states have internal predecessors, (191), 27 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 01:40:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 245 transitions. [2025-03-04 01:40:50,705 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 245 transitions. Word has length 86 [2025-03-04 01:40:50,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:50,706 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 245 transitions. [2025-03-04 01:40:50,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 20 states have internal predecessors, (85), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 5 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 01:40:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 245 transitions. [2025-03-04 01:40:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 01:40:50,707 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:50,707 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:50,719 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:40:50,916 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:40:51,107 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:40:51,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:51,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:51,108 INFO L85 PathProgramCache]: Analyzing trace with hash 261217112, now seen corresponding path program 1 times [2025-03-04 01:40:51,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:51,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459338053] [2025-03-04 01:40:51,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:51,108 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:40:51,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:51,110 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:40:51,111 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:40:51,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:40:51,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:40:51,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:51,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:51,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:40:51,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 01:40:51,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:51,275 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459338053] [2025-03-04 01:40:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459338053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:51,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:51,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:40:51,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125571245] [2025-03-04 01:40:51,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:51,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:40:51,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:51,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:40:51,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:40:51,276 INFO L87 Difference]: Start difference. First operand 181 states and 245 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:40:51,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:51,369 INFO L93 Difference]: Finished difference Result 323 states and 429 transitions. [2025-03-04 01:40:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:40:51,370 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2025-03-04 01:40:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:51,371 INFO L225 Difference]: With dead ends: 323 [2025-03-04 01:40:51,371 INFO L226 Difference]: Without dead ends: 139 [2025-03-04 01:40:51,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:51,372 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:51,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 553 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:40:51,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-04 01:40:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2025-03-04 01:40:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.2727272727272727) internal successors, (140), 111 states have internal predecessors, (140), 18 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-04 01:40:51,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 176 transitions. [2025-03-04 01:40:51,386 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 176 transitions. Word has length 86 [2025-03-04 01:40:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:51,386 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 176 transitions. [2025-03-04 01:40:51,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:40:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 176 transitions. [2025-03-04 01:40:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 01:40:51,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:51,387 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:51,395 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:40:51,587 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:40:51,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:51,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:51,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1352803434, now seen corresponding path program 1 times [2025-03-04 01:40:51,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:51,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002548671] [2025-03-04 01:40:51,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:51,588 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:40:51,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:51,590 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:40:51,591 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:40:51,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:40:51,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:40:51,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:51,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:51,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:40:51,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:51,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:51,804 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 66 treesize of output 24 [2025-03-04 01:40:51,834 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:51,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:51,834 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:51,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002548671] [2025-03-04 01:40:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002548671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:51,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:51,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:40:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527064200] [2025-03-04 01:40:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:51,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:51,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:51,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:51,835 INFO L87 Difference]: Start difference. First operand 135 states and 176 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:52,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:52,625 INFO L93 Difference]: Finished difference Result 390 states and 510 transitions. [2025-03-04 01:40:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:40:52,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2025-03-04 01:40:52,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:52,628 INFO L225 Difference]: With dead ends: 390 [2025-03-04 01:40:52,628 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 01:40:52,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:40:52,628 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 104 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:52,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 283 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:40:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 01:40:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 246. [2025-03-04 01:40:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 197 states have (on average 1.248730964467005) internal successors, (246), 199 states have internal predecessors, (246), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:40:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 318 transitions. [2025-03-04 01:40:52,648 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 318 transitions. Word has length 86 [2025-03-04 01:40:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:52,648 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 318 transitions. [2025-03-04 01:40:52,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 318 transitions. [2025-03-04 01:40:52,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 01:40:52,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:52,649 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:52,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-04 01:40:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:40:52,850 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:52,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1246894764, now seen corresponding path program 1 times [2025-03-04 01:40:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:52,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515078583] [2025-03-04 01:40:52,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:52,851 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:40:52,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:52,853 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:40:52,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-04 01:40:52,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 01:40:53,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 01:40:53,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:53,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:53,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 01:40:53,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:53,014 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 19 treesize of output 1 [2025-03-04 01:40:53,123 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 42 treesize of output 20 [2025-03-04 01:40:53,170 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 42 treesize of output 20 [2025-03-04 01:40:53,222 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 42 treesize of output 20 [2025-03-04 01:40:53,278 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 44 treesize of output 31 [2025-03-04 01:40:53,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:53,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 44 [2025-03-04 01:40:55,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:55,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 44 [2025-03-04 01:40:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 47 proven. 36 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-04 01:40:55,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:40:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:55,585 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:55,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515078583] [2025-03-04 01:40:55,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515078583] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:55,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:55,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2025-03-04 01:40:55,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724121263] [2025-03-04 01:40:55,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:55,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:40:55,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:55,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:40:55,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=226, Unknown=1, NotChecked=0, Total=272 [2025-03-04 01:40:55,587 INFO L87 Difference]: Start difference. First operand 246 states and 318 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:56,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:56,016 INFO L93 Difference]: Finished difference Result 630 states and 817 transitions. [2025-03-04 01:40:56,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:40:56,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 86 [2025-03-04 01:40:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:56,021 INFO L225 Difference]: With dead ends: 630 [2025-03-04 01:40:56,022 INFO L226 Difference]: Without dead ends: 387 [2025-03-04 01:40:56,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=57, Invalid=322, Unknown=1, NotChecked=0, Total=380 [2025-03-04 01:40:56,023 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 79 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:56,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 377 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:40:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-04 01:40:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 287. [2025-03-04 01:40:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 238 states have (on average 1.2647058823529411) internal successors, (301), 240 states have internal predecessors, (301), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 01:40:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 373 transitions. [2025-03-04 01:40:56,047 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 373 transitions. Word has length 86 [2025-03-04 01:40:56,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:56,048 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 373 transitions. [2025-03-04 01:40:56,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:56,048 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 373 transitions. [2025-03-04 01:40:56,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-04 01:40:56,049 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:56,049 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:56,057 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 (12)] Ended with exit code 0 [2025-03-04 01:40:56,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:40:56,250 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:56,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:56,251 INFO L85 PathProgramCache]: Analyzing trace with hash -13769633, now seen corresponding path program 1 times [2025-03-04 01:40:56,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:56,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327412660] [2025-03-04 01:40:56,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:56,251 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:40:56,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:56,253 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:40:56,253 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:40:56,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-04 01:40:56,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-04 01:40:56,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:56,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:56,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:40:56,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:56,462 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:40:56,462 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:56,462 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:56,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327412660] [2025-03-04 01:40:56,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327412660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:56,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:56,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:40:56,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139908110] [2025-03-04 01:40:56,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:56,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:40:56,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:56,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:40:56,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:40:56,463 INFO L87 Difference]: Start difference. First operand 287 states and 373 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:56,835 INFO L93 Difference]: Finished difference Result 868 states and 1125 transitions. [2025-03-04 01:40:56,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:40:56,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 87 [2025-03-04 01:40:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:56,840 INFO L225 Difference]: With dead ends: 868 [2025-03-04 01:40:56,840 INFO L226 Difference]: Without dead ends: 584 [2025-03-04 01:40:56,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:40:56,841 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 209 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:56,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 248 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:40:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-04 01:40:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 437. [2025-03-04 01:40:56,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 364 states have (on average 1.25) internal successors, (455), 367 states have internal predecessors, (455), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:40:56,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 563 transitions. [2025-03-04 01:40:56,883 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 563 transitions. Word has length 87 [2025-03-04 01:40:56,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:56,884 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 563 transitions. [2025-03-04 01:40:56,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:40:56,884 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 563 transitions. [2025-03-04 01:40:56,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 01:40:56,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:56,885 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:56,891 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:40:57,085 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:40:57,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:57,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash 573669108, now seen corresponding path program 1 times [2025-03-04 01:40:57,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:57,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964230900] [2025-03-04 01:40:57,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:57,086 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:40:57,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:57,088 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:40:57,089 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:40:57,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 01:40:57,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 01:40:57,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:57,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:57,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 01:40:57,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:57,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:40:57,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:57,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 59 [2025-03-04 01:40:57,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:57,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 69 [2025-03-04 01:40:58,089 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:58,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-04 01:40:58,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:58,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-04 01:40:58,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:58,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-04 01:40:58,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:58,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 72 [2025-03-04 01:40:58,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:58,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 112 [2025-03-04 01:40:59,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:59,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 349 treesize of output 123 [2025-03-04 01:40:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 01:40:59,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:40:59,321 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964230900] [2025-03-04 01:40:59,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964230900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:40:59,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:40:59,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:40:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020294382] [2025-03-04 01:40:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:59,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:40:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:59,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:40:59,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:40:59,322 INFO L87 Difference]: Start difference. First operand 437 states and 563 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:41:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:02,757 INFO L93 Difference]: Finished difference Result 1145 states and 1486 transitions. [2025-03-04 01:41:02,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 01:41:02,758 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2025-03-04 01:41:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:02,760 INFO L225 Difference]: With dead ends: 1145 [2025-03-04 01:41:02,760 INFO L226 Difference]: Without dead ends: 711 [2025-03-04 01:41:02,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2025-03-04 01:41:02,762 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 305 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:02,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1395 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 01:41:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-04 01:41:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 538. [2025-03-04 01:41:02,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 462 states have (on average 1.274891774891775) internal successors, (589), 462 states have internal predecessors, (589), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:41:02,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 697 transitions. [2025-03-04 01:41:02,792 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 697 transitions. Word has length 88 [2025-03-04 01:41:02,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:02,792 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 697 transitions. [2025-03-04 01:41:02,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 15 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:41:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 697 transitions. [2025-03-04 01:41:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 01:41:02,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:02,793 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:02,801 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 (14)] Ended with exit code 0 [2025-03-04 01:41:02,994 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:41:02,994 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:02,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1830212767, now seen corresponding path program 1 times [2025-03-04 01:41:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:41:02,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431532919] [2025-03-04 01:41:02,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:02,995 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:41:02,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:41:02,997 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:41:02,998 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:41:03,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 01:41:03,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 01:41:03,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:03,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:03,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 01:41:03,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:41:03,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:41:03,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:03,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 59 [2025-03-04 01:41:03,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:03,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 69 [2025-03-04 01:41:03,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:03,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-04 01:41:03,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:03,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-04 01:41:03,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:03,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 72 [2025-03-04 01:41:03,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:03,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 200 treesize of output 113 [2025-03-04 01:41:04,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:04,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 405 treesize of output 135 [2025-03-04 01:41:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 01:41:04,353 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:41:04,353 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:41:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431532919] [2025-03-04 01:41:04,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431532919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:04,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:04,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:41:04,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010631740] [2025-03-04 01:41:04,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:04,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:41:04,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:41:04,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:41:04,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:41:04,354 INFO L87 Difference]: Start difference. First operand 538 states and 697 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:41:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:06,036 INFO L93 Difference]: Finished difference Result 681 states and 878 transitions. [2025-03-04 01:41:06,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:41:06,037 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-03-04 01:41:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:06,039 INFO L225 Difference]: With dead ends: 681 [2025-03-04 01:41:06,039 INFO L226 Difference]: Without dead ends: 679 [2025-03-04 01:41:06,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:41:06,040 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 233 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:06,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 963 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:41:06,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-04 01:41:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 655. [2025-03-04 01:41:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 579 states have (on average 1.2780656303972366) internal successors, (740), 579 states have internal predecessors, (740), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:41:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 848 transitions. [2025-03-04 01:41:06,083 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 848 transitions. Word has length 89 [2025-03-04 01:41:06,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:06,084 INFO L471 AbstractCegarLoop]: Abstraction has 655 states and 848 transitions. [2025-03-04 01:41:06,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 01:41:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 848 transitions. [2025-03-04 01:41:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 01:41:06,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:06,084 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:06,092 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:41:06,285 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:41:06,285 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:06,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:06,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1831136288, now seen corresponding path program 1 times [2025-03-04 01:41:06,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:41:06,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [715290593] [2025-03-04 01:41:06,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:06,286 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:41:06,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:41:06,288 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:41:06,289 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:41:06,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 01:41:06,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 01:41:06,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:06,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:06,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:41:06,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:41:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 01:41:06,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:41:06,437 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:41:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [715290593] [2025-03-04 01:41:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [715290593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:41:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:41:06,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:41:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662734441] [2025-03-04 01:41:06,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:41:06,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:41:06,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:41:06,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:41:06,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:41:06,438 INFO L87 Difference]: Start difference. First operand 655 states and 848 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:41:06,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:41:06,484 INFO L93 Difference]: Finished difference Result 1325 states and 1717 transitions. [2025-03-04 01:41:06,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:41:06,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-03-04 01:41:06,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:41:06,487 INFO L225 Difference]: With dead ends: 1325 [2025-03-04 01:41:06,487 INFO L226 Difference]: Without dead ends: 673 [2025-03-04 01:41:06,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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:41:06,488 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:41:06,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:41:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-04 01:41:06,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-03-04 01:41:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 597 states have (on average 1.269681742043551) internal successors, (758), 597 states have internal predecessors, (758), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-04 01:41:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 866 transitions. [2025-03-04 01:41:06,519 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 866 transitions. Word has length 89 [2025-03-04 01:41:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:41:06,519 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 866 transitions. [2025-03-04 01:41:06,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-04 01:41:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 866 transitions. [2025-03-04 01:41:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-04 01:41:06,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:41:06,521 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:06,526 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 (16)] Ended with exit code 0 [2025-03-04 01:41:06,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:41:06,722 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:41:06,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:41:06,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1231665326, now seen corresponding path program 1 times [2025-03-04 01:41:06,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:41:06,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776411900] [2025-03-04 01:41:06,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:41:06,722 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:41:06,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:41:06,724 INFO L229 MonitoredProcess]: Starting monitored process 17 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:41:06,725 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 (17)] Waiting until timeout for monitored process [2025-03-04 01:41:06,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-04 01:41:06,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-04 01:41:06,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:41:06,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:41:06,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 01:41:06,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:41:06,961 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 20 treesize of output 21 [2025-03-04 01:41:09,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:09,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 65 [2025-03-04 01:41:09,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:09,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 75 [2025-03-04 01:41:09,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:09,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2025-03-04 01:41:10,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:10,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2025-03-04 01:41:10,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:10,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-04 01:41:10,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:10,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 86 [2025-03-04 01:41:14,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:41:14,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 122 treesize of output 44 [2025-03-04 01:41:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 104 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 01:41:17,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:41:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-04 01:41:17,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:41:17,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776411900] [2025-03-04 01:41:17,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776411900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:41:17,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:41:17,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 22 [2025-03-04 01:41:17,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410333946] [2025-03-04 01:41:17,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:41:17,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 01:41:17,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:41:17,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 01:41:17,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=339, Unknown=3, NotChecked=0, Total=462 [2025-03-04 01:41:17,349 INFO L87 Difference]: Start difference. First operand 673 states and 866 transitions. Second operand has 22 states, 20 states have (on average 4.7) internal successors, (94), 21 states have internal predecessors, (94), 7 states have call successors, (18), 6 states have call predecessors, (18), 7 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2025-03-04 01:41:22,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:41:24,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:41:31,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:41:37,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:41:40,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:41:44,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:41:48,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:41:51,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:41:55,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]