./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_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 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:46:34,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:46:34,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:46:34,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:46:34,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:46:34,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:46:34,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:46:34,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:46:34,620 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:46:34,620 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:46:34,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:46:34,621 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:46:34,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:46:34,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:46:34,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:46:34,622 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:34,622 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:46:34,622 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:46:34,623 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:46:34,623 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:46:34,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:46:34,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:46:34,623 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:46:34,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:46:34,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:46:34,623 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 -> 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d [2025-03-17 05:46:34,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:46:34,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:46:34,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:46:34,854 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:46:34,854 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:46:34,855 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2025-03-17 05:46:36,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cfd28ba5/2c5da407958d4beea5506ac281cbf5a8/FLAG55fd2a5c9 [2025-03-17 05:46:36,340 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:46:36,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2025-03-17 05:46:36,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cfd28ba5/2c5da407958d4beea5506ac281cbf5a8/FLAG55fd2a5c9 [2025-03-17 05:46:36,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cfd28ba5/2c5da407958d4beea5506ac281cbf5a8 [2025-03-17 05:46:36,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:46:36,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:46:36,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:36,388 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:46:36,392 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:46:36,393 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e45b1bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36, skipping insertion in model container [2025-03-17 05:46:36,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:46:36,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i[916,929] [2025-03-17 05:46:36,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:36,582 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:46:36,591 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i[916,929] [2025-03-17 05:46:36,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:36,624 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:46:36,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36 WrapperNode [2025-03-17 05:46:36,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:36,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:36,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:46:36,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:46:36,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,670 INFO L138 Inliner]: procedures = 29, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 473 [2025-03-17 05:46:36,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:36,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:46:36,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:46:36,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:46:36,681 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,706 INFO L175 MemorySlicer]: Split 115 memory accesses to 10 slices as follows [2, 5, 16, 35, 12, 10, 14, 6, 8, 7]. 30 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 1, 2, 1, 1, 2, 1, 1, 1]. [2025-03-17 05:46:36,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,719 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:46:36,727 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:46:36,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:46:36,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:46:36,728 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (1/1) ... [2025-03-17 05:46:36,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:36,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:36,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:46:36,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:46:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:46:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:46:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:46:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:46:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:46:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:46:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:46:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:46:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:46:36,777 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:46:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:46:36,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:46:36,912 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:46:36,914 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:46:37,176 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: 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-17 05:46:37,213 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-03-17 05:46:37,213 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:46:37,249 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:46:37,249 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:46:37,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:37 BoogieIcfgContainer [2025-03-17 05:46:37,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:46:37,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:46:37,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:46:37,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:46:37,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:46:36" (1/3) ... [2025-03-17 05:46:37,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af73e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:37, skipping insertion in model container [2025-03-17 05:46:37,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:36" (2/3) ... [2025-03-17 05:46:37,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af73e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:37, skipping insertion in model container [2025-03-17 05:46:37,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:37" (3/3) ... [2025-03-17 05:46:37,258 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-47.i [2025-03-17 05:46:37,268 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:46:37,269 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-47.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:46:37,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:46:37,339 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;@579d97db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:46:37,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:46:37,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 79 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-17 05:46:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:37,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:37,353 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] [2025-03-17 05:46:37,354 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:37,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:37,359 INFO L85 PathProgramCache]: Analyzing trace with hash -17524125, now seen corresponding path program 1 times [2025-03-17 05:46:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:37,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-03-17 05:46:37,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:37,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:37,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:37,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:37,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:37,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:37,662 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-17 05:46:37,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:37,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253107391] [2025-03-17 05:46:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253107391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:37,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335293938] [2025-03-17 05:46:37,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:37,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:37,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:37,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:46:37,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:46:37,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:37,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:37,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:37,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:37,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:46:37,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:37,868 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-17 05:46:37,869 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:37,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335293938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:37,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:37,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:46:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269289177] [2025-03-17 05:46:37,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:37,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:46:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:37,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:46:37,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:37,893 INFO L87 Difference]: Start difference. First operand has 90 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 79 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) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-17 05:46:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:37,912 INFO L93 Difference]: Finished difference Result 177 states and 275 transitions. [2025-03-17 05:46:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:46:37,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 80 [2025-03-17 05:46:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:37,919 INFO L225 Difference]: With dead ends: 177 [2025-03-17 05:46:37,919 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:46:37,922 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:37,925 INFO L435 NwaCegarLoop]: 130 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, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:37,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:46:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 05:46:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 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-17 05:46:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2025-03-17 05:46:37,965 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 80 [2025-03-17 05:46:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:37,966 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2025-03-17 05:46:37,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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-17 05:46:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2025-03-17 05:46:37,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:37,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:37,971 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] [2025-03-17 05:46:37,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:46:38,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:46:38,173 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:38,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:38,174 INFO L85 PathProgramCache]: Analyzing trace with hash 387441772, now seen corresponding path program 1 times [2025-03-17 05:46:38,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:38,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692815405] [2025-03-17 05:46:38,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:38,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:38,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:38,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:38,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:38,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:38,506 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-17 05:46:38,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692815405] [2025-03-17 05:46:38,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692815405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404410376] [2025-03-17 05:46:38,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:38,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:38,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:38,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:46:38,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:46:38,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:38,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:38,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:38,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:38,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:46:38,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:38,715 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-17 05:46:38,716 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:38,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404410376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:38,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:38,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-17 05:46:38,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147980103] [2025-03-17 05:46:38,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:38,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:46:38,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:38,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:46:38,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:46:38,721 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-17 05:46:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:38,756 INFO L93 Difference]: Finished difference Result 178 states and 263 transitions. [2025-03-17 05:46:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:46:38,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 80 [2025-03-17 05:46:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:38,757 INFO L225 Difference]: With dead ends: 178 [2025-03-17 05:46:38,759 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 05:46:38,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:46:38,760 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 372 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-17 05:46:38,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 372 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 05:46:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2025-03-17 05:46:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 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-17 05:46:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2025-03-17 05:46:38,769 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 80 [2025-03-17 05:46:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:38,770 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2025-03-17 05:46:38,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-17 05:46:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2025-03-17 05:46:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:38,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:38,771 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] [2025-03-17 05:46:38,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:46:38,972 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,SelfDestructingSolverStorable1 [2025-03-17 05:46:38,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:38,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:38,975 INFO L85 PathProgramCache]: Analyzing trace with hash 388365293, now seen corresponding path program 1 times [2025-03-17 05:46:38,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:38,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206158487] [2025-03-17 05:46:38,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:38,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:38,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:39,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:39,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:39,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:39,188 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-17 05:46:39,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:39,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206158487] [2025-03-17 05:46:39,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206158487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:39,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200605007] [2025-03-17 05:46:39,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:39,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:39,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:39,193 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:46:39,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:46:39,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:39,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:39,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:39,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:39,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:46:39,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:39,375 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-17 05:46:39,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:39,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200605007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:39,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:39,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:46:39,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025010335] [2025-03-17 05:46:39,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:39,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:39,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:39,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:39,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:46:39,377 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:39,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:39,403 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2025-03-17 05:46:39,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:39,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 80 [2025-03-17 05:46:39,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:39,408 INFO L225 Difference]: With dead ends: 182 [2025-03-17 05:46:39,408 INFO L226 Difference]: Without dead ends: 93 [2025-03-17 05:46:39,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 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-17 05:46:39,408 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 493 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-17 05:46:39,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:39,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-17 05:46:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-17 05:46:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 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-17 05:46:39,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-17 05:46:39,418 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 80 [2025-03-17 05:46:39,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:39,418 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-17 05:46:39,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-17 05:46:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:39,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:39,421 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] [2025-03-17 05:46:39,428 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-17 05:46:39,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:39,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:39,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:39,623 INFO L85 PathProgramCache]: Analyzing trace with hash -91756203, now seen corresponding path program 1 times [2025-03-17 05:46:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:39,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996709155] [2025-03-17 05:46:39,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:39,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:39,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:39,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:39,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:39,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:39,929 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-17 05:46:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:39,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996709155] [2025-03-17 05:46:39,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996709155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:39,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:39,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:46:39,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410003488] [2025-03-17 05:46:39,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:39,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:39,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:39,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:39,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:39,931 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:40,097 INFO L93 Difference]: Finished difference Result 275 states and 400 transitions. [2025-03-17 05:46:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:46:40,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 80 [2025-03-17 05:46:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:40,101 INFO L225 Difference]: With dead ends: 275 [2025-03-17 05:46:40,101 INFO L226 Difference]: Without dead ends: 183 [2025-03-17 05:46:40,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:46:40,102 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 118 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:40,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 419 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-17 05:46:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 171. [2025-03-17 05:46:40,119 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-17 05:46:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 247 transitions. [2025-03-17 05:46:40,120 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 247 transitions. Word has length 80 [2025-03-17 05:46:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:40,121 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 247 transitions. [2025-03-17 05:46:40,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 247 transitions. [2025-03-17 05:46:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:40,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:40,122 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] [2025-03-17 05:46:40,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:46:40,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:40,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash 37326516, now seen corresponding path program 1 times [2025-03-17 05:46:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716194013] [2025-03-17 05:46:40,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:40,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:40,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:40,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:40,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:40,261 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-17 05:46:40,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:46:40,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716194013] [2025-03-17 05:46:40,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716194013] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:40,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539449806] [2025-03-17 05:46:40,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:40,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:40,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:40,265 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:46:40,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:46:40,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:40,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:40,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:40,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:40,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:46:40,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:40,437 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-17 05:46:40,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539449806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:40,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:46:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133439678] [2025-03-17 05:46:40,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:40,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:46:40,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:40,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:46:40,440 INFO L87 Difference]: Start difference. First operand 171 states and 247 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:40,465 INFO L93 Difference]: Finished difference Result 346 states and 500 transitions. [2025-03-17 05:46:40,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:40,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 80 [2025-03-17 05:46:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:40,467 INFO L225 Difference]: With dead ends: 346 [2025-03-17 05:46:40,468 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 05:46:40,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 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-17 05:46:40,470 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 498 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-17 05:46:40,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 498 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 05:46:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2025-03-17 05:46:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.403973509933775) internal successors, (212), 151 states have internal predecessors, (212), 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-17 05:46:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 248 transitions. [2025-03-17 05:46:40,487 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 248 transitions. Word has length 80 [2025-03-17 05:46:40,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:40,487 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 248 transitions. [2025-03-17 05:46:40,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 248 transitions. [2025-03-17 05:46:40,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:40,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:40,492 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] [2025-03-17 05:46:40,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:46:40,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:46:40,692 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:40,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1391744884, now seen corresponding path program 1 times [2025-03-17 05:46:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:46:40,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370190099] [2025-03-17 05:46:40,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:40,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:46:40,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:40,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:40,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:40,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:46:40,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:46:40,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:40,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:40,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:40,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:46:40,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:46:40,888 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:46:40,889 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:46:40,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:46:40,894 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-17 05:46:41,050 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:46:41,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:46:41 BoogieIcfgContainer [2025-03-17 05:46:41,052 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:46:41,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:46:41,053 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:46:41,053 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:46:41,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:37" (3/4) ... [2025-03-17 05:46:41,055 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:46:41,055 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:46:41,056 INFO L158 Benchmark]: Toolchain (without parser) took 4670.58ms. Allocated memory is still 201.3MB. Free memory was 160.2MB in the beginning and 134.2MB in the end (delta: 26.0MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2025-03-17 05:46:41,056 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:41,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.70ms. Allocated memory is still 201.3MB. Free memory was 159.8MB in the beginning and 146.4MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:46:41,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.86ms. Allocated memory is still 201.3MB. Free memory was 146.4MB in the beginning and 143.8MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:46:41,056 INFO L158 Benchmark]: Boogie Preprocessor took 53.10ms. Allocated memory is still 201.3MB. Free memory was 143.8MB in the beginning and 140.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:41,057 INFO L158 Benchmark]: IcfgBuilder took 522.69ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 107.8MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:46:41,057 INFO L158 Benchmark]: TraceAbstraction took 3800.00ms. Allocated memory is still 201.3MB. Free memory was 107.0MB in the beginning and 134.3MB in the end (delta: -27.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:41,057 INFO L158 Benchmark]: Witness Printer took 2.69ms. Allocated memory is still 201.3MB. Free memory was 134.3MB in the beginning and 134.2MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:46:41,058 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.19ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.70ms. Allocated memory is still 201.3MB. Free memory was 159.8MB in the beginning and 146.4MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.86ms. Allocated memory is still 201.3MB. Free memory was 146.4MB in the beginning and 143.8MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.10ms. Allocated memory is still 201.3MB. Free memory was 143.8MB in the beginning and 140.1MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 522.69ms. Allocated memory is still 201.3MB. Free memory was 140.1MB in the beginning and 107.8MB in the end (delta: 32.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3800.00ms. Allocated memory is still 201.3MB. Free memory was 107.0MB in the beginning and 134.3MB in the end (delta: -27.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.69ms. Allocated memory is still 201.3MB. Free memory was 134.3MB in the beginning and 134.2MB in the end (delta: 60.0kB). 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 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L22] double var_1_1 = 24.575; [L23] double* var_1_1_Pointer = &(var_1_1); [L24] double var_1_8 = 3.5; [L24] double var_1_8 = 3.5; [L25] double* var_1_8_Pointer = &(var_1_8); [L26] signed char var_1_9 = 16; [L26] signed char var_1_9 = 16; [L27] signed char* var_1_9_Pointer = &(var_1_9); [L28] signed char var_1_10 = 16; [L28] signed char var_1_10 = 16; [L29] signed char* var_1_10_Pointer = &(var_1_10); [L30] signed char var_1_11 = 4; [L30] signed char var_1_11 = 4; [L31] signed char* var_1_11_Pointer = &(var_1_11); [L32] signed long int var_1_12 = 8; [L32] signed long int var_1_12 = 8; [L33] signed long int* var_1_12_Pointer = &(var_1_12); [L34] unsigned char var_1_13 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char* var_1_13_Pointer = &(var_1_13); [L36] unsigned char var_1_14 = 1; [L36] unsigned char var_1_14 = 1; [L37] unsigned char* var_1_14_Pointer = &(var_1_14); [L38] double var_1_15 = 3.8; [L38] double var_1_15 = 3.8; [L39] double* var_1_15_Pointer = &(var_1_15); [L40] signed long int last_1_var_1_12 = 8; [L94] isInitial = 1 [L95] FCALL initially() [L96] COND TRUE 1 [L97] CALL updateLastVariables() [L87] EXPR \read(var_1_12) [L87] last_1_var_1_12 = var_1_12 [L97] RET updateLastVariables() [L98] CALL updateVariables() [L71] var_1_8 = __VERIFIER_nondet_double() [L72] EXPR \read(var_1_8) [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F [L72] EXPR \read(var_1_8) [L72] EXPR var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR (var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] EXPR (var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L72] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L73] var_1_10 = __VERIFIER_nondet_char() [L74] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L74] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L75] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L76] var_1_11 = __VERIFIER_nondet_char() [L77] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L77] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L77] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L78] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L79] var_1_13 = __VERIFIER_nondet_uchar() [L80] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L80] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L81] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L82] var_1_14 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L83] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] EXPR \read(var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L84] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L98] RET updateVariables() [L99] CALL step() [L44] COND FALSE !(-4 > last_1_var_1_12) [L49] EXPR \read(*var_1_10_Pointer) [L49] (*(var_1_9_Pointer)) = (*(var_1_10_Pointer)) [L51] EXPR \read(*var_1_13_Pointer) [L51] unsigned char stepLocal_0 = ! (*(var_1_13_Pointer)); [L52] stepLocal_0 || (*(var_1_14_Pointer)) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] stepLocal_0 || (*(var_1_14_Pointer)) [L52] EXPR \read(*var_1_14_Pointer) [L52] stepLocal_0 || (*(var_1_14_Pointer)) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L52] COND FALSE !(stepLocal_0 || (*(var_1_14_Pointer))) [L59] EXPR \read(*var_1_8_Pointer) [L59] (*(var_1_15_Pointer)) = (*(var_1_8_Pointer)) [L60] EXPR \read(*var_1_15_Pointer) [L60] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L60] COND FALSE !((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) [L65] EXPR \read(*var_1_12_Pointer) [L65] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L65] COND TRUE (*(var_1_12_Pointer)) > (*(var_1_9_Pointer)) [L66] EXPR \read(*var_1_8_Pointer) [L66] (*(var_1_1_Pointer)) = (*(var_1_8_Pointer)) [L99] RET step() [L100] CALL, EXPR property() [L90] EXPR \read(*var_1_15_Pointer) [L90] EXPR \read(*var_1_15_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1) [L90] EXPR \read(*var_1_12_Pointer) [L90] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1 [L90] EXPR \read(*var_1_1_Pointer) [L90] EXPR \read(*var_1_8_Pointer) [L90] EXPR ((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1 VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer))))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR ((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90] EXPR (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L90-L91] return (((((*(var_1_15_Pointer)) <= (*(var_1_15_Pointer))) ? ((((*(var_1_12_Pointer)) + (*(var_1_12_Pointer))) >= ((*(var_1_12_Pointer)) + (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((double) (((((*(var_1_8_Pointer))) < 0 ) ? -((*(var_1_8_Pointer))) : ((*(var_1_8_Pointer))))))) : 1) : (((*(var_1_12_Pointer)) > (*(var_1_9_Pointer))) ? ((*(var_1_1_Pointer)) == ((double) (*(var_1_8_Pointer)))) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) < 0 ) ? -((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))) : ((*(var_1_10_Pointer)) + (*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) (*(var_1_10_Pointer)))))) && (((! (*(var_1_13_Pointer))) || (*(var_1_14_Pointer))) ? ((! (*(var_1_14_Pointer))) ? ((*(var_1_12_Pointer)) == ((signed long int) ((((((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) < 0 ) ? -(((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))) : (((((*(var_1_9_Pointer))) < ((*(var_1_9_Pointer)))) ? ((*(var_1_9_Pointer))) : ((*(var_1_9_Pointer))))))))) : ((*(var_1_12_Pointer)) == ((signed long int) (*(var_1_9_Pointer))))) : 1)) && ((*(var_1_15_Pointer)) == ((double) (*(var_1_8_Pointer)))) ; [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, var_1_10={7:0}, var_1_10_Pointer={7:0}, var_1_11={8:0}, var_1_11_Pointer={8:0}, var_1_12={9:0}, var_1_12_Pointer={9:0}, var_1_13={10:0}, var_1_13_Pointer={10:0}, var_1_14={11:0}, var_1_14_Pointer={11:0}, var_1_15={12:0}, var_1_15_Pointer={12:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_8={5:0}, var_1_8_Pointer={5:0}, var_1_9={6:0}, var_1_9_Pointer={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 143 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 6, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 1912 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1279 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 241 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 633 mSDtfsCounter, 241 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 349 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=172occurred 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 800 NumberOfCodeBlocks, 800 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 711 ConstructedInterpolants, 0 QuantifiedInterpolants, 811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1516 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 1253/1296 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:46:41,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-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 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:46:43,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:46:43,730 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:46:43,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:46:43,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:46:43,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:46:43,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:46:43,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:46:43,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:46:43,760 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:46:43,760 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:46:43,760 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:46:43,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:46:43,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:46:43,762 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:46:43,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:46:43,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:46:43,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:46:43,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:46:43,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:43,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:46:43,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:46:43,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:46:43,764 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:46:43,764 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:46:43,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:46:43,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:46:43,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:46:43,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:46:43,764 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 -> 804ea379911faa50c100b1ca218961e1e4eb6bc8f92c2960862a083a6d1b879d [2025-03-17 05:46:43,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:46:43,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:46:43,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:46:43,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:46:43,988 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:46:43,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2025-03-17 05:46:45,131 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9b0b651/9bab22ba4c1b4c12b1b8ee764516ac5b/FLAG9a6eb69c4 [2025-03-17 05:46:45,339 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:46:45,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i [2025-03-17 05:46:45,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9b0b651/9bab22ba4c1b4c12b1b8ee764516ac5b/FLAG9a6eb69c4 [2025-03-17 05:46:45,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9b0b651/9bab22ba4c1b4c12b1b8ee764516ac5b [2025-03-17 05:46:45,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:46:45,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:46:45,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:45,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:46:45,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:46:45,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fa09696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45, skipping insertion in model container [2025-03-17 05:46:45,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,712 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:46:45,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i[916,929] [2025-03-17 05:46:45,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:45,862 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:46:45,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-47.i[916,929] [2025-03-17 05:46:45,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:46:45,900 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:46:45,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45 WrapperNode [2025-03-17 05:46:45,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:46:45,902 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:45,902 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:46:45,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:46:45,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,950 INFO L138 Inliner]: procedures = 33, calls = 144, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2025-03-17 05:46:45,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:46:45,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:46:45,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:46:45,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:46:45,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,987 INFO L175 MemorySlicer]: Split 115 memory accesses to 10 slices as follows [2, 5, 16, 35, 12, 10, 14, 6, 8, 7]. 30 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 12 writes are split as follows [0, 2, 1, 2, 1, 1, 2, 1, 1, 1]. [2025-03-17 05:46:45,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:45,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:46,003 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:46,004 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:46,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:46,009 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:46,015 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:46:46,015 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:46:46,015 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:46:46,017 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:46:46,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (1/1) ... [2025-03-17 05:46:46,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:46:46,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:46:46,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:46:46,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:46:46,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:46:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:46:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:46:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:46:46,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-03-17 05:46:46,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:46:46,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:46:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:46:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:46:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:46:46,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:46:46,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:46:46,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:46:46,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-17 05:46:46,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-17 05:46:46,232 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:46:46,233 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:46:46,657 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L90: 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-17 05:46:46,707 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2025-03-17 05:46:46,708 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:46:46,718 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:46:46,719 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:46:46,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:46 BoogieIcfgContainer [2025-03-17 05:46:46,719 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:46:46,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:46:46,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:46:46,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:46:46,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:46:45" (1/3) ... [2025-03-17 05:46:46,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36168690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:46, skipping insertion in model container [2025-03-17 05:46:46,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:46:45" (2/3) ... [2025-03-17 05:46:46,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36168690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:46:46, skipping insertion in model container [2025-03-17 05:46:46,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:46:46" (3/3) ... [2025-03-17 05:46:46,729 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-47.i [2025-03-17 05:46:46,739 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:46:46,740 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-47.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:46:46,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:46:46,783 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;@33c3c61a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:46:46,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:46:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 79 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-17 05:46:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:46,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:46,796 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] [2025-03-17 05:46:46,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:46,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash -17524125, now seen corresponding path program 1 times [2025-03-17 05:46:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:46,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078251507] [2025-03-17 05:46:46,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:46,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:46,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:46,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:46,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:46:46,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:47,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:47,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:47,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:47,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:46:47,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:47,093 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-17 05:46:47,093 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:47,094 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:47,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078251507] [2025-03-17 05:46:47,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078251507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:47,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:47,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:46:47,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139500817] [2025-03-17 05:46:47,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:47,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:46:47,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:47,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:46:47,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:47,116 INFO L87 Difference]: Start difference. First operand has 90 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 79 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) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:46:47,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:47,136 INFO L93 Difference]: Finished difference Result 177 states and 275 transitions. [2025-03-17 05:46:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:46:47,142 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 80 [2025-03-17 05:46:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:47,148 INFO L225 Difference]: With dead ends: 177 [2025-03-17 05:46:47,148 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 05:46:47,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:46:47,152 INFO L435 NwaCegarLoop]: 130 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, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:47,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 05:46:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 05:46:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 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-17 05:46:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2025-03-17 05:46:47,181 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 80 [2025-03-17 05:46:47,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:47,181 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2025-03-17 05:46:47,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-17 05:46:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2025-03-17 05:46:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:47,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:47,186 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] [2025-03-17 05:46:47,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:46:47,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:47,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:47,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash 387441772, now seen corresponding path program 1 times [2025-03-17 05:46:47,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:47,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587074] [2025-03-17 05:46:47,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:47,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:47,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:47,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:47,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:46:47,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:47,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:47,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:47,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:47,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:46:47,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:47,738 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-17 05:46:47,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:47,739 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:47,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587074] [2025-03-17 05:46:47,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:47,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:47,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:46:47,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199191442] [2025-03-17 05:46:47,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:47,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:47,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:47,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:47,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:47,743 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:47,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:47,783 INFO L93 Difference]: Finished difference Result 178 states and 263 transitions. [2025-03-17 05:46:47,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:47,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 80 [2025-03-17 05:46:47,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:47,788 INFO L225 Difference]: With dead ends: 178 [2025-03-17 05:46:47,788 INFO L226 Difference]: Without dead ends: 91 [2025-03-17 05:46:47,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:47,789 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 493 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-17 05:46:47,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 493 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:47,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-17 05:46:47,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-17 05:46:47,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.4375) internal successors, (115), 80 states have internal predecessors, (115), 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-17 05:46:47,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2025-03-17 05:46:47,822 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 80 [2025-03-17 05:46:47,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:47,823 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2025-03-17 05:46:47,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2025-03-17 05:46:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:47,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:47,825 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] [2025-03-17 05:46:47,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:46:48,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:48,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:48,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:48,033 INFO L85 PathProgramCache]: Analyzing trace with hash -92679724, now seen corresponding path program 1 times [2025-03-17 05:46:48,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:48,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787455215] [2025-03-17 05:46:48,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:48,034 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:48,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:48,036 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:48,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:46:48,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:48,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:48,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:48,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:48,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:46:48,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:48,483 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-17 05:46:48,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:48,484 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:48,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787455215] [2025-03-17 05:46:48,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787455215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:48,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:48,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:46:48,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529039408] [2025-03-17 05:46:48,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:48,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:48,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:48,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:48,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:48,485 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:48,534 INFO L93 Difference]: Finished difference Result 186 states and 272 transitions. [2025-03-17 05:46:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:48,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 80 [2025-03-17 05:46:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:48,539 INFO L225 Difference]: With dead ends: 186 [2025-03-17 05:46:48,539 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 05:46:48,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:46:48,540 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 487 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.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:48,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 487 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:46:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 05:46:48,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-03-17 05:46:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 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-17 05:46:48,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-03-17 05:46:48,548 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 80 [2025-03-17 05:46:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:48,549 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-03-17 05:46:48,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-03-17 05:46:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:48,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:48,550 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] [2025-03-17 05:46:48,558 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-17 05:46:48,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:48,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:48,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:48,752 INFO L85 PathProgramCache]: Analyzing trace with hash -91756203, now seen corresponding path program 1 times [2025-03-17 05:46:48,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:48,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493580905] [2025-03-17 05:46:48,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:48,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:48,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:48,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:48,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:46:48,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:48,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:48,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:48,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:48,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:46:49,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:49,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 05:46:49,529 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 13 treesize of output 9 [2025-03-17 05:46:49,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2025-03-17 05:46:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 05:46:49,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:50,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:50,392 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 50 treesize of output 49 [2025-03-17 05:46:50,606 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:50,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493580905] [2025-03-17 05:46:50,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493580905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:50,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1338444409] [2025-03-17 05:46:50,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:50,607 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:46:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:46:50,638 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:46:50,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-17 05:46:50,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:51,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:51,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:51,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:51,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:46:51,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:51,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:51,520 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 178 treesize of output 58 [2025-03-17 05:46:51,594 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-17 05:46:51,594 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:51,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1338444409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:51,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:51,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2025-03-17 05:46:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462213309] [2025-03-17 05:46:51,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:51,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:51,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:51,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:51,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2025-03-17 05:46:51,596 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:51,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:51,826 INFO L93 Difference]: Finished difference Result 276 states and 397 transitions. [2025-03-17 05:46:51,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:51,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 80 [2025-03-17 05:46:51,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:51,828 INFO L225 Difference]: With dead ends: 276 [2025-03-17 05:46:51,828 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 05:46:51,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:46:51,829 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 119 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:51,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 499 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 05:46:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 97. [2025-03-17 05:46:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 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-17 05:46:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-03-17 05:46:51,848 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 80 [2025-03-17 05:46:51,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:51,848 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-03-17 05:46:51,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-17 05:46:51,848 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-03-17 05:46:51,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:51,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:51,854 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] [2025-03-17 05:46:51,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:46:52,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-17 05:46:52,257 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:46:52,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:52,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1391744884, now seen corresponding path program 1 times [2025-03-17 05:46:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:52,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021258420] [2025-03-17 05:46:52,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:52,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:52,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:52,262 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:52,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:46:52,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:52,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:52,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:52,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:52,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:46:52,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:53,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:53,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 62 [2025-03-17 05:46:54,183 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-17 05:46:54,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:54,184 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:54,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021258420] [2025-03-17 05:46:54,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021258420] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:54,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:54,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:46:54,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019454236] [2025-03-17 05:46:54,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:54,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:46:54,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:54,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:46:54,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:46:54,185 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-17 05:46:55,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:55,476 INFO L93 Difference]: Finished difference Result 281 states and 402 transitions. [2025-03-17 05:46:55,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:46:55,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 80 [2025-03-17 05:46:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:55,480 INFO L225 Difference]: With dead ends: 281 [2025-03-17 05:46:55,480 INFO L226 Difference]: Without dead ends: 185 [2025-03-17 05:46:55,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:46:55,481 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 306 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:55,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 586 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:46:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-17 05:46:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 138. [2025-03-17 05:46:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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-17 05:46:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2025-03-17 05:46:55,497 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 80 [2025-03-17 05:46:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:55,497 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2025-03-17 05:46:55,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-17 05:46:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2025-03-17 05:46:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-17 05:46:55,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:55,501 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] [2025-03-17 05:46:55,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 05:46:55,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:55,703 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:55,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:55,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1811261715, now seen corresponding path program 1 times [2025-03-17 05:46:55,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:55,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165900399] [2025-03-17 05:46:55,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:55,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:55,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:55,711 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:55,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 05:46:55,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-17 05:46:55,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-17 05:46:55,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:55,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:55,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:46:55,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:55,978 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-17 05:46:55,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:46:55,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:55,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165900399] [2025-03-17 05:46:55,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165900399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:46:55,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:46:55,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:46:55,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903967869] [2025-03-17 05:46:55,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:55,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:46:55,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:55,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:46:55,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:55,980 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-17 05:46:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:56,044 INFO L93 Difference]: Finished difference Result 275 states and 397 transitions. [2025-03-17 05:46:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:46:56,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 80 [2025-03-17 05:46:56,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:56,046 INFO L225 Difference]: With dead ends: 275 [2025-03-17 05:46:56,046 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 05:46:56,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:46:56,047 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:56,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:56,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 05:46:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-17 05:46:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 117 states have (on average 1.3846153846153846) internal successors, (162), 117 states have internal predecessors, (162), 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-17 05:46:56,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 198 transitions. [2025-03-17 05:46:56,060 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 198 transitions. Word has length 80 [2025-03-17 05:46:56,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:56,060 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 198 transitions. [2025-03-17 05:46:56,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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-17 05:46:56,060 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 198 transitions. [2025-03-17 05:46:56,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 05:46:56,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:56,061 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] [2025-03-17 05:46:56,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 05:46:56,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:56,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1687300074, now seen corresponding path program 1 times [2025-03-17 05:46:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [882706525] [2025-03-17 05:46:56,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:56,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:46:56,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:56,266 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:46:56,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 05:46:56,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 05:46:56,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 05:46:56,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:56,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:56,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:46:56,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:57,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:57,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 60 [2025-03-17 05:46:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:46:57,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:57,490 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [882706525] [2025-03-17 05:46:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [882706525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [408123864] [2025-03-17 05:46:57,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:57,490 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:46:57,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:46:57,492 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:46:57,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2025-03-17 05:46:57,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 05:46:58,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 05:46:58,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:58,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:58,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 05:46:58,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:58,596 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-17 05:47:08,679 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 21 treesize of output 10 [2025-03-17 05:47:08,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 68 [2025-03-17 05:47:08,976 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:47:08,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:47:09,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [408123864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:47:09,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:47:09,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2025-03-17 05:47:09,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712686946] [2025-03-17 05:47:09,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:47:09,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:47:09,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:09,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:47:09,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2025-03-17 05:47:09,367 INFO L87 Difference]: Start difference. First operand 138 states and 198 transitions. Second operand has 21 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:47:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:11,031 INFO L93 Difference]: Finished difference Result 368 states and 523 transitions. [2025-03-17 05:47:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 05:47:11,032 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 82 [2025-03-17 05:47:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:11,033 INFO L225 Difference]: With dead ends: 368 [2025-03-17 05:47:11,033 INFO L226 Difference]: Without dead ends: 231 [2025-03-17 05:47:11,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=228, Invalid=1103, Unknown=1, NotChecked=0, Total=1332 [2025-03-17 05:47:11,034 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 457 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 457 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:11,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [457 Valid, 1153 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:47:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-17 05:47:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 164. [2025-03-17 05:47:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 132 states have (on average 1.3409090909090908) internal successors, (177), 133 states have internal predecessors, (177), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:47:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 231 transitions. [2025-03-17 05:47:11,050 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 231 transitions. Word has length 82 [2025-03-17 05:47:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:11,050 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 231 transitions. [2025-03-17 05:47:11,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:47:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 231 transitions. [2025-03-17 05:47:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 05:47:11,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:11,051 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] [2025-03-17 05:47:11,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 05:47:11,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2025-03-17 05:47:11,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:47:11,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:11,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1673767273, now seen corresponding path program 1 times [2025-03-17 05:47:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:11,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140716465] [2025-03-17 05:47:11,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:11,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:11,456 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:47:11,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 05:47:11,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 05:47:11,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 05:47:11,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:11,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:11,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:47:11,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:11,674 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-17 05:47:11,674 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:11,674 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:11,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140716465] [2025-03-17 05:47:11,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140716465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:11,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:11,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:47:11,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144918878] [2025-03-17 05:47:11,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:11,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:47:11,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:11,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:47:11,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:47:11,675 INFO L87 Difference]: Start difference. First operand 164 states and 231 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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-17 05:47:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:11,771 INFO L93 Difference]: Finished difference Result 292 states and 404 transitions. [2025-03-17 05:47:11,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:47:11,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 82 [2025-03-17 05:47:11,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:11,773 INFO L225 Difference]: With dead ends: 292 [2025-03-17 05:47:11,773 INFO L226 Difference]: Without dead ends: 123 [2025-03-17 05:47:11,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 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-17 05:47:11,774 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 533 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-17 05:47:11,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 533 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:47:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-17 05:47:11,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-03-17 05:47:11,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.309278350515464) internal successors, (127), 98 states have internal predecessors, (127), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 05:47:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2025-03-17 05:47:11,782 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 82 [2025-03-17 05:47:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:11,782 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2025-03-17 05:47:11,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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-17 05:47:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2025-03-17 05:47:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 05:47:11,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:11,783 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] [2025-03-17 05:47:11,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2025-03-17 05:47:11,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:11,989 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:11,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash -14914033, now seen corresponding path program 1 times [2025-03-17 05:47:11,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:11,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866880115] [2025-03-17 05:47:11,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:11,990 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:11,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:11,991 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:47:11,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-17 05:47:12,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 05:47:12,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 05:47:12,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:12,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:12,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 05:47:12,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:12,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-03-17 05:47:12,856 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 13 treesize of output 9 [2025-03-17 05:47:13,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2025-03-17 05:47:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-17 05:47:13,219 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:47:13,443 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-17 05:47:13,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:13,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866880115] [2025-03-17 05:47:13,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866880115] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:47:13,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:47:13,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-17 05:47:13,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704062422] [2025-03-17 05:47:13,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:13,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:47:13,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:13,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:47:13,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:47:13,447 INFO L87 Difference]: Start difference. First operand 119 states and 163 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-17 05:47:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:13,925 INFO L93 Difference]: Finished difference Result 348 states and 478 transitions. [2025-03-17 05:47:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:47:13,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 82 [2025-03-17 05:47:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:13,928 INFO L225 Difference]: With dead ends: 348 [2025-03-17 05:47:13,928 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 05:47:13,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:47:13,928 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 110 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:13,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 408 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:47:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 05:47:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 218. [2025-03-17 05:47:13,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 175 states have (on average 1.2914285714285714) internal successors, (226), 177 states have internal predecessors, (226), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-17 05:47:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 298 transitions. [2025-03-17 05:47:13,958 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 298 transitions. Word has length 82 [2025-03-17 05:47:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:13,958 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 298 transitions. [2025-03-17 05:47:13,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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-17 05:47:13,958 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 298 transitions. [2025-03-17 05:47:13,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-17 05:47:13,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:13,959 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] [2025-03-17 05:47:13,968 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-17 05:47:14,163 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-17 05:47:14,163 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:14,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:14,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1710183131, now seen corresponding path program 1 times [2025-03-17 05:47:14,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:14,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33255258] [2025-03-17 05:47:14,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:14,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:14,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:14,168 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-17 05:47:14,169 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-17 05:47:14,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 05:47:14,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 05:47:14,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:14,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:14,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:47:14,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:14,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 05:47:14,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 50 [2025-03-17 05:47:14,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 44 [2025-03-17 05:47:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 05:47:14,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:47:15,004 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-17 05:47:15,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33255258] [2025-03-17 05:47:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [33255258] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:47:15,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:47:15,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 18 [2025-03-17 05:47:15,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597318062] [2025-03-17 05:47:15,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:15,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:47:15,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:15,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:47:15,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:47:15,006 INFO L87 Difference]: Start difference. First operand 218 states and 298 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-17 05:47:15,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:15,654 INFO L93 Difference]: Finished difference Result 642 states and 864 transitions. [2025-03-17 05:47:15,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:47:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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 82 [2025-03-17 05:47:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:15,657 INFO L225 Difference]: With dead ends: 642 [2025-03-17 05:47:15,657 INFO L226 Difference]: Without dead ends: 425 [2025-03-17 05:47:15,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:47:15,658 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 315 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:15,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 594 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:47:15,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-17 05:47:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 350. [2025-03-17 05:47:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 303 states have (on average 1.3267326732673268) internal successors, (402), 307 states have internal predecessors, (402), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:47:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 478 transitions. [2025-03-17 05:47:15,687 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 478 transitions. Word has length 82 [2025-03-17 05:47:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:15,690 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 478 transitions. [2025-03-17 05:47:15,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 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-17 05:47:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 478 transitions. [2025-03-17 05:47:15,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-17 05:47:15,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:15,691 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] [2025-03-17 05:47:15,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2025-03-17 05:47:15,892 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-17 05:47:15,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:15,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:15,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1488871165, now seen corresponding path program 1 times [2025-03-17 05:47:15,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:15,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343634266] [2025-03-17 05:47:15,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:15,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:15,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:15,895 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-17 05:47:15,897 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-17 05:47:15,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-17 05:47:16,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-17 05:47:16,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:16,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:16,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:47:16,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:16,156 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-17 05:47:16,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:16,156 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:16,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343634266] [2025-03-17 05:47:16,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343634266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:16,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:16,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:47:16,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574763116] [2025-03-17 05:47:16,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:16,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:47:16,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:16,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:47:16,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:47:16,157 INFO L87 Difference]: Start difference. First operand 350 states and 478 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-17 05:47:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:16,324 INFO L93 Difference]: Finished difference Result 976 states and 1321 transitions. [2025-03-17 05:47:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:47:16,324 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 83 [2025-03-17 05:47:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:16,327 INFO L225 Difference]: With dead ends: 976 [2025-03-17 05:47:16,327 INFO L226 Difference]: Without dead ends: 627 [2025-03-17 05:47:16,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 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-17 05:47:16,329 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 213 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:16,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 338 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:47:16,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-17 05:47:16,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 465. [2025-03-17 05:47:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 407 states have (on average 1.3120393120393121) internal successors, (534), 411 states have internal predecessors, (534), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-17 05:47:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 628 transitions. [2025-03-17 05:47:16,356 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 628 transitions. Word has length 83 [2025-03-17 05:47:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:16,356 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 628 transitions. [2025-03-17 05:47:16,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-17 05:47:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 628 transitions. [2025-03-17 05:47:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 05:47:16,357 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:16,357 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-17 05:47:16,364 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-17 05:47:16,557 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-17 05:47:16,557 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:16,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:16,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2090161869, now seen corresponding path program 1 times [2025-03-17 05:47:16,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:16,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268137893] [2025-03-17 05:47:16,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:16,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:16,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:16,560 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-17 05:47:16,561 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-17 05:47:16,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 05:47:16,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 05:47:16,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:16,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:16,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 05:47:16,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:18,392 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 18 treesize of output 19 [2025-03-17 05:47:18,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:47:18,537 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 64 treesize of output 24 [2025-03-17 05:47:18,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:47:18,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 79 [2025-03-17 05:47:18,900 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-17 05:47:18,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:18,900 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:18,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268137893] [2025-03-17 05:47:18,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268137893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:18,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:18,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:47:18,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904669604] [2025-03-17 05:47:18,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:18,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:47:18,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:18,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:47:18,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:47:18,901 INFO L87 Difference]: Start difference. First operand 465 states and 628 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 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-17 05:47:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:21,478 INFO L93 Difference]: Finished difference Result 1347 states and 1822 transitions. [2025-03-17 05:47:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 05:47:21,479 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 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-17 05:47:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:21,482 INFO L225 Difference]: With dead ends: 1347 [2025-03-17 05:47:21,483 INFO L226 Difference]: Without dead ends: 883 [2025-03-17 05:47:21,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 05:47:21,484 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 375 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1495 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:21,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1495 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:47:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-17 05:47:21,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 590. [2025-03-17 05:47:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 521 states have (on average 1.328214971209213) internal successors, (692), 523 states have internal predecessors, (692), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:47:21,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 804 transitions. [2025-03-17 05:47:21,521 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 804 transitions. Word has length 84 [2025-03-17 05:47:21,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:21,522 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 804 transitions. [2025-03-17 05:47:21,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 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-17 05:47:21,522 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 804 transitions. [2025-03-17 05:47:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-17 05:47:21,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:21,523 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-17 05:47:21,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2025-03-17 05:47:21,723 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-17 05:47:21,723 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:21,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1796758862, now seen corresponding path program 1 times [2025-03-17 05:47:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024931603] [2025-03-17 05:47:21,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:21,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:21,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:21,726 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-17 05:47:21,727 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-17 05:47:21,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-17 05:47:21,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-17 05:47:21,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:21,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:21,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:47:21,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:22,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:47:22,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 36 [2025-03-17 05:47:22,689 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-17 05:47:22,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:22,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:22,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024931603] [2025-03-17 05:47:22,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024931603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:22,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:22,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:47:22,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142323012] [2025-03-17 05:47:22,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:22,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:47:22,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:22,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:47:22,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:47:22,691 INFO L87 Difference]: Start difference. First operand 590 states and 804 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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-17 05:47:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:23,309 INFO L93 Difference]: Finished difference Result 1366 states and 1855 transitions. [2025-03-17 05:47:23,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:47:23,311 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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-17 05:47:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:23,314 INFO L225 Difference]: With dead ends: 1366 [2025-03-17 05:47:23,314 INFO L226 Difference]: Without dead ends: 777 [2025-03-17 05:47:23,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:47:23,316 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 283 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:23,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 545 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:47:23,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-03-17 05:47:23,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 590. [2025-03-17 05:47:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 521 states have (on average 1.3186180422264875) internal successors, (687), 523 states have internal predecessors, (687), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:47:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 799 transitions. [2025-03-17 05:47:23,359 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 799 transitions. Word has length 84 [2025-03-17 05:47:23,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:23,359 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 799 transitions. [2025-03-17 05:47:23,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 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-17 05:47:23,359 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 799 transitions. [2025-03-17 05:47:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 05:47:23,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:23,360 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] [2025-03-17 05:47:23,368 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-17 05:47:23,561 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-17 05:47:23,561 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:23,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:23,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1596848099, now seen corresponding path program 1 times [2025-03-17 05:47:23,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:23,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502448438] [2025-03-17 05:47:23,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:23,562 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:23,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:23,564 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-17 05:47:23,567 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-17 05:47:23,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 05:47:23,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 05:47:23,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:23,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:23,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:47:23,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:24,512 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 18 treesize of output 19 [2025-03-17 05:47:25,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:47:25,211 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 233 treesize of output 133 [2025-03-17 05:47:25,224 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:47:25,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 135 [2025-03-17 05:47:25,308 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-17 05:47:25,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:25,308 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:25,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502448438] [2025-03-17 05:47:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [502448438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:25,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:25,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:47:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792751149] [2025-03-17 05:47:25,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:25,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:47:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:25,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:47:25,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:47:25,309 INFO L87 Difference]: Start difference. First operand 590 states and 799 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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-17 05:47:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:26,891 INFO L93 Difference]: Finished difference Result 794 states and 1068 transitions. [2025-03-17 05:47:26,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:47:26,893 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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 85 [2025-03-17 05:47:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:26,896 INFO L225 Difference]: With dead ends: 794 [2025-03-17 05:47:26,896 INFO L226 Difference]: Without dead ends: 792 [2025-03-17 05:47:26,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:47:26,897 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 320 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:26,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 854 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:47:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2025-03-17 05:47:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 757. [2025-03-17 05:47:26,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 688 states have (on average 1.3241279069767442) internal successors, (911), 690 states have internal predecessors, (911), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:47:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1023 transitions. [2025-03-17 05:47:26,936 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1023 transitions. Word has length 85 [2025-03-17 05:47:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:26,936 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1023 transitions. [2025-03-17 05:47:26,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 11 states have internal predecessors, (43), 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-17 05:47:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1023 transitions. [2025-03-17 05:47:26,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 05:47:26,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:26,937 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] [2025-03-17 05:47:26,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2025-03-17 05:47:27,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:27,138 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:27,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1597771620, now seen corresponding path program 1 times [2025-03-17 05:47:27,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:27,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240117972] [2025-03-17 05:47:27,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:27,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:27,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:27,141 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:47:27,142 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 (18)] Waiting until timeout for monitored process [2025-03-17 05:47:27,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 05:47:27,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 05:47:27,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:27,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:27,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:47:27,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:27,382 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-17 05:47:27,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:47:27,382 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:27,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240117972] [2025-03-17 05:47:27,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [240117972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:47:27,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:47:27,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:47:27,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39501765] [2025-03-17 05:47:27,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:47:27,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:47:27,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:27,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:47:27,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:47:27,383 INFO L87 Difference]: Start difference. First operand 757 states and 1023 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (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-17 05:47:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:27,445 INFO L93 Difference]: Finished difference Result 1543 states and 2085 transitions. [2025-03-17 05:47:27,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:47:27,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (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 85 [2025-03-17 05:47:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:27,448 INFO L225 Difference]: With dead ends: 1543 [2025-03-17 05:47:27,448 INFO L226 Difference]: Without dead ends: 787 [2025-03-17 05:47:27,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:47:27,449 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 461 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-17 05:47:27,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 461 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:47:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-17 05:47:27,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 787. [2025-03-17 05:47:27,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 718 states have (on average 1.3105849582172702) internal successors, (941), 720 states have internal predecessors, (941), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:47:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1053 transitions. [2025-03-17 05:47:27,486 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1053 transitions. Word has length 85 [2025-03-17 05:47:27,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:27,487 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1053 transitions. [2025-03-17 05:47:27,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (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-17 05:47:27,487 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1053 transitions. [2025-03-17 05:47:27,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:47:27,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:27,490 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-17 05:47:27,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2025-03-17 05:47:27,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:27,691 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:27,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:27,691 INFO L85 PathProgramCache]: Analyzing trace with hash -180767121, now seen corresponding path program 1 times [2025-03-17 05:47:27,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:27,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189566705] [2025-03-17 05:47:27,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:27,692 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:27,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:27,693 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:47:27,694 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 (19)] Waiting until timeout for monitored process [2025-03-17 05:47:27,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:47:27,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:47:27,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:27,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:27,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:47:27,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:29,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:47:29,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 54 [2025-03-17 05:47:29,328 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:47:29,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:47:30,044 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2025-03-17 05:47:30,045 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 149 treesize of output 92 [2025-03-17 05:47:36,479 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-17 05:47:36,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:36,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189566705] [2025-03-17 05:47:36,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189566705] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:47:36,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:47:36,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-17 05:47:36,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345563593] [2025-03-17 05:47:36,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:47:36,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:47:36,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:36,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:47:36,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2025-03-17 05:47:36,482 INFO L87 Difference]: Start difference. First operand 787 states and 1053 transitions. Second operand has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:47:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:37,940 INFO L93 Difference]: Finished difference Result 1620 states and 2156 transitions. [2025-03-17 05:47:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:47:37,942 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 86 [2025-03-17 05:47:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:37,944 INFO L225 Difference]: With dead ends: 1620 [2025-03-17 05:47:37,945 INFO L226 Difference]: Without dead ends: 834 [2025-03-17 05:47:37,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=234, Invalid=757, Unknown=1, NotChecked=0, Total=992 [2025-03-17 05:47:37,946 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 339 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:37,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1654 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 572 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:47:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-03-17 05:47:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 787. [2025-03-17 05:47:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 718 states have (on average 1.3022284122562675) internal successors, (935), 720 states have internal predecessors, (935), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:47:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1047 transitions. [2025-03-17 05:47:37,988 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1047 transitions. Word has length 86 [2025-03-17 05:47:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:37,989 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1047 transitions. [2025-03-17 05:47:37,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.529411764705882) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:47:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1047 transitions. [2025-03-17 05:47:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:47:37,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:37,990 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-17 05:47:37,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2025-03-17 05:47:38,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:38,190 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:38,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:38,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1177839474, now seen corresponding path program 1 times [2025-03-17 05:47:38,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:38,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092623244] [2025-03-17 05:47:38,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:38,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:38,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:38,193 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:47:38,194 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 (20)] Waiting until timeout for monitored process [2025-03-17 05:47:38,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:47:38,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:47:38,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:38,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:38,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:47:38,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:39,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:47:39,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 54 [2025-03-17 05:47:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:47:39,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:47:40,489 INFO L349 Elim1Store]: treesize reduction 15, result has 69.4 percent of original size [2025-03-17 05:47:40,489 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 149 treesize of output 92 [2025-03-17 05:47:46,806 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-17 05:47:46,806 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:46,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092623244] [2025-03-17 05:47:46,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092623244] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:47:46,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:47:46,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-03-17 05:47:46,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436440313] [2025-03-17 05:47:46,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:47:46,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:47:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:47:46,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:47:46,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=276, Unknown=1, NotChecked=0, Total=342 [2025-03-17 05:47:46,807 INFO L87 Difference]: Start difference. First operand 787 states and 1047 transitions. Second operand has 19 states, 17 states have (on average 4.823529411764706) internal successors, (82), 18 states have internal predecessors, (82), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:47:48,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:47:48,275 INFO L93 Difference]: Finished difference Result 1620 states and 2144 transitions. [2025-03-17 05:47:48,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:47:48,276 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 4.823529411764706) internal successors, (82), 18 states have internal predecessors, (82), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 86 [2025-03-17 05:47:48,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:47:48,278 INFO L225 Difference]: With dead ends: 1620 [2025-03-17 05:47:48,278 INFO L226 Difference]: Without dead ends: 834 [2025-03-17 05:47:48,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=234, Invalid=757, Unknown=1, NotChecked=0, Total=992 [2025-03-17 05:47:48,280 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 628 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:47:48,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1566 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:47:48,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2025-03-17 05:47:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 787. [2025-03-17 05:47:48,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 718 states have (on average 1.2952646239554317) internal successors, (930), 720 states have internal predecessors, (930), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:47:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1042 transitions. [2025-03-17 05:47:48,313 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1042 transitions. Word has length 86 [2025-03-17 05:47:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:47:48,313 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1042 transitions. [2025-03-17 05:47:48,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 4.823529411764706) internal successors, (82), 18 states have internal predecessors, (82), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:47:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1042 transitions. [2025-03-17 05:47:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-17 05:47:48,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:47:48,314 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-17 05:47:48,322 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 (20)] Ended with exit code 0 [2025-03-17 05:47:48,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:48,515 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:47:48,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:47:48,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1471242481, now seen corresponding path program 1 times [2025-03-17 05:47:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:47:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936407626] [2025-03-17 05:47:48,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:48,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:47:48,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:47:48,518 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:47:48,518 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 (21)] Waiting until timeout for monitored process [2025-03-17 05:47:48,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:47:48,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:47:48,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:48,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:48,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:47:48,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:49,531 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 18 treesize of output 19 [2025-03-17 05:47:49,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:47:49,670 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 64 treesize of output 24 [2025-03-17 05:47:49,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:47:49,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 75 [2025-03-17 05:47:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:47:49,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:47:50,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:47:50,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936407626] [2025-03-17 05:47:50,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936407626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:47:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [24569831] [2025-03-17 05:47:50,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:47:50,349 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:47:50,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:47:50,351 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:47:50,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2025-03-17 05:47:50,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 05:47:51,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 05:47:51,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:47:51,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:47:51,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 05:47:51,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:47:51,678 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-17 05:48:00,091 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-17 05:48:00,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:48:00,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 24 [2025-03-17 05:48:00,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 83 [2025-03-17 05:48:04,762 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:48:04,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:48:05,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [24569831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:05,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:48:05,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 29 [2025-03-17 05:48:05,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113992085] [2025-03-17 05:48:05,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:48:05,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-17 05:48:05,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:05,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-17 05:48:05,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1179, Unknown=2, NotChecked=0, Total=1332 [2025-03-17 05:48:05,003 INFO L87 Difference]: Start difference. First operand 787 states and 1042 transitions. Second operand has 30 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 27 states have internal predecessors, (83), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:48:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:08,889 INFO L93 Difference]: Finished difference Result 1690 states and 2225 transitions. [2025-03-17 05:48:08,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 05:48:08,890 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 27 states have internal predecessors, (83), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 86 [2025-03-17 05:48:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:08,893 INFO L225 Difference]: With dead ends: 1690 [2025-03-17 05:48:08,893 INFO L226 Difference]: Without dead ends: 904 [2025-03-17 05:48:08,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 866 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=474, Invalid=3064, Unknown=2, NotChecked=0, Total=3540 [2025-03-17 05:48:08,896 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 753 mSDsluCounter, 1821 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:08,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1977 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-17 05:48:08,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-03-17 05:48:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 764. [2025-03-17 05:48:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 695 states have (on average 1.297841726618705) internal successors, (902), 697 states have internal predecessors, (902), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:48:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1014 transitions. [2025-03-17 05:48:08,943 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1014 transitions. Word has length 86 [2025-03-17 05:48:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:08,943 INFO L471 AbstractCegarLoop]: Abstraction has 764 states and 1014 transitions. [2025-03-17 05:48:08,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.9642857142857144) internal successors, (83), 27 states have internal predecessors, (83), 4 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-17 05:48:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1014 transitions. [2025-03-17 05:48:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:48:08,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:08,945 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-17 05:48:08,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2025-03-17 05:48:09,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2025-03-17 05:48:09,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:09,345 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:09,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash -82473855, now seen corresponding path program 1 times [2025-03-17 05:48:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:09,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1497325978] [2025-03-17 05:48:09,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:09,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:09,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:09,388 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:09,389 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 (23)] Waiting until timeout for monitored process [2025-03-17 05:48:09,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:48:09,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:48:09,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:09,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:09,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 05:48:09,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:10,558 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 18 treesize of output 19 [2025-03-17 05:48:11,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:48:11,368 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 233 treesize of output 133 [2025-03-17 05:48:11,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:48:11,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 133 [2025-03-17 05:48:11,516 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:48:11,516 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:48:12,025 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-17 05:48:12,026 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:12,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1497325978] [2025-03-17 05:48:12,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1497325978] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:12,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:12,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2025-03-17 05:48:12,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942306560] [2025-03-17 05:48:12,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:12,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:48:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:12,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:48:12,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:48:12,027 INFO L87 Difference]: Start difference. First operand 764 states and 1014 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-17 05:48:12,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:12,455 INFO L93 Difference]: Finished difference Result 782 states and 1036 transitions. [2025-03-17 05:48:12,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:48:12,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-17 05:48:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:12,459 INFO L225 Difference]: With dead ends: 782 [2025-03-17 05:48:12,459 INFO L226 Difference]: Without dead ends: 780 [2025-03-17 05:48:12,459 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:48:12,461 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 86 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:12,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 490 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:48:12,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-17 05:48:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 592. [2025-03-17 05:48:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 523 states have (on average 1.2868068833652007) internal successors, (673), 525 states have internal predecessors, (673), 56 states have call successors, (56), 12 states have call predecessors, (56), 12 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-17 05:48:12,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 785 transitions. [2025-03-17 05:48:12,520 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 785 transitions. Word has length 87 [2025-03-17 05:48:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:12,527 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 785 transitions. [2025-03-17 05:48:12,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 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-17 05:48:12,527 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 785 transitions. [2025-03-17 05:48:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:48:12,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:12,528 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-17 05:48:12,542 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 (23)] Ended with exit code 0 [2025-03-17 05:48:12,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:12,729 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:12,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash -421492462, now seen corresponding path program 1 times [2025-03-17 05:48:12,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:12,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979575495] [2025-03-17 05:48:12,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:12,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:12,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:12,734 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:12,735 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 (24)] Waiting until timeout for monitored process [2025-03-17 05:48:12,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:48:12,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:48:12,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:12,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:12,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:48:12,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:48:13,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:48:13,399 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-17 05:48:13,399 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:13,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979575495] [2025-03-17 05:48:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [979575495] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:13,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-03-17 05:48:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332452640] [2025-03-17 05:48:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:13,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:13,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:13,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:13,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:48:13,400 INFO L87 Difference]: Start difference. First operand 592 states and 785 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (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-17 05:48:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:13,564 INFO L93 Difference]: Finished difference Result 1554 states and 2046 transitions. [2025-03-17 05:48:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:13,565 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (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-17 05:48:13,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:13,568 INFO L225 Difference]: With dead ends: 1554 [2025-03-17 05:48:13,568 INFO L226 Difference]: Without dead ends: 963 [2025-03-17 05:48:13,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:48:13,569 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 76 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:13,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 511 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:48:13,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2025-03-17 05:48:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 955. [2025-03-17 05:48:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 830 states have (on average 1.2650602409638554) internal successors, (1050), 840 states have internal predecessors, (1050), 100 states have call successors, (100), 24 states have call predecessors, (100), 24 states have return successors, (100), 90 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-17 05:48:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1250 transitions. [2025-03-17 05:48:13,643 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1250 transitions. Word has length 87 [2025-03-17 05:48:13,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:13,643 INFO L471 AbstractCegarLoop]: Abstraction has 955 states and 1250 transitions. [2025-03-17 05:48:13,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (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-17 05:48:13,644 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1250 transitions. [2025-03-17 05:48:13,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-17 05:48:13,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:13,646 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-17 05:48:13,654 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 (24)] Ended with exit code 0 [2025-03-17 05:48:13,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:13,848 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:13,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2076523475, now seen corresponding path program 1 times [2025-03-17 05:48:13,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:13,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054281855] [2025-03-17 05:48:13,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:13,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:13,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:13,851 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:13,852 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 (25)] Waiting until timeout for monitored process [2025-03-17 05:48:13,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-17 05:48:14,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-17 05:48:14,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:14,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:14,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:48:14,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 2 proven. 78 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 05:48:14,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:48:14,455 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-17 05:48:14,455 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:14,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054281855] [2025-03-17 05:48:14,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054281855] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:14,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:14,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-17 05:48:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144394668] [2025-03-17 05:48:14,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:14,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:48:14,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:14,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:48:14,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:48:14,456 INFO L87 Difference]: Start difference. First operand 955 states and 1250 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (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-17 05:48:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:14,593 INFO L93 Difference]: Finished difference Result 2238 states and 2898 transitions. [2025-03-17 05:48:14,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:48:14,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (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-17 05:48:14,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:14,598 INFO L225 Difference]: With dead ends: 2238 [2025-03-17 05:48:14,598 INFO L226 Difference]: Without dead ends: 1326 [2025-03-17 05:48:14,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:48:14,600 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 84 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:14,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 448 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:14,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2025-03-17 05:48:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1320. [2025-03-17 05:48:14,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1157 states have (on average 1.250648228176318) internal successors, (1447), 1173 states have internal predecessors, (1447), 122 states have call successors, (122), 40 states have call predecessors, (122), 40 states have return successors, (122), 106 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-17 05:48:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1691 transitions. [2025-03-17 05:48:14,697 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1691 transitions. Word has length 87 [2025-03-17 05:48:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:14,698 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1691 transitions. [2025-03-17 05:48:14,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (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-17 05:48:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1691 transitions. [2025-03-17 05:48:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:48:14,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:14,699 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-17 05:48:14,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2025-03-17 05:48:14,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:14,900 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:14,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:14,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1611195606, now seen corresponding path program 1 times [2025-03-17 05:48:14,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:14,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347250629] [2025-03-17 05:48:14,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:14,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:14,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:14,903 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:14,906 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 (26)] Waiting until timeout for monitored process [2025-03-17 05:48:15,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:48:15,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:48:15,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:15,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:15,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 05:48:15,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:15,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 05:48:15,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-03-17 05:48:15,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 05:48:15,245 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-17 05:48:15,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:15,246 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:15,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347250629] [2025-03-17 05:48:15,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347250629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:15,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:15,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:48:15,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679255519] [2025-03-17 05:48:15,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:15,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:15,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:15,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:15,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:48:15,247 INFO L87 Difference]: Start difference. First operand 1320 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-17 05:48:15,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:15,642 INFO L93 Difference]: Finished difference Result 2801 states and 3597 transitions. [2025-03-17 05:48:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:15,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 88 [2025-03-17 05:48:15,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:15,648 INFO L225 Difference]: With dead ends: 2801 [2025-03-17 05:48:15,648 INFO L226 Difference]: Without dead ends: 1734 [2025-03-17 05:48:15,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-17 05:48:15,650 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 114 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:15,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 457 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:48:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2025-03-17 05:48:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1696. [2025-03-17 05:48:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1478 states have (on average 1.2313937753721245) internal successors, (1820), 1498 states have internal predecessors, (1820), 164 states have call successors, (164), 53 states have call predecessors, (164), 53 states have return successors, (164), 144 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-17 05:48:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2148 transitions. [2025-03-17 05:48:15,764 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2148 transitions. Word has length 88 [2025-03-17 05:48:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:15,764 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2148 transitions. [2025-03-17 05:48:15,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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-17 05:48:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2148 transitions. [2025-03-17 05:48:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 05:48:15,765 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:15,766 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-17 05:48:15,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2025-03-17 05:48:15,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:15,966 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:15,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:15,967 INFO L85 PathProgramCache]: Analyzing trace with hash 225567192, now seen corresponding path program 1 times [2025-03-17 05:48:15,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:15,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423632777] [2025-03-17 05:48:15,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:15,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:15,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:15,969 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:15,969 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 (27)] Waiting until timeout for monitored process [2025-03-17 05:48:16,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 05:48:16,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 05:48:16,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:16,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:16,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:48:16,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:16,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2025-03-17 05:48:16,300 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-17 05:48:16,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:16,300 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:16,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423632777] [2025-03-17 05:48:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423632777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:16,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:16,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:48:16,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221418864] [2025-03-17 05:48:16,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:16,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:48:16,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:16,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:48:16,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:48:16,301 INFO L87 Difference]: Start difference. First operand 1696 states and 2148 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-17 05:48:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:16,677 INFO L93 Difference]: Finished difference Result 3125 states and 3986 transitions. [2025-03-17 05:48:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:48:16,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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 90 [2025-03-17 05:48:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:16,683 INFO L225 Difference]: With dead ends: 3125 [2025-03-17 05:48:16,683 INFO L226 Difference]: Without dead ends: 1742 [2025-03-17 05:48:16,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:48:16,685 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 102 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:16,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 969 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:48:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2025-03-17 05:48:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1698. [2025-03-17 05:48:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1480 states have (on average 1.231081081081081) internal successors, (1822), 1500 states have internal predecessors, (1822), 164 states have call successors, (164), 53 states have call predecessors, (164), 53 states have return successors, (164), 144 states have call predecessors, (164), 164 states have call successors, (164) [2025-03-17 05:48:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 2150 transitions. [2025-03-17 05:48:16,833 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 2150 transitions. Word has length 90 [2025-03-17 05:48:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:16,833 INFO L471 AbstractCegarLoop]: Abstraction has 1698 states and 2150 transitions. [2025-03-17 05:48:16,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 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-17 05:48:16,835 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 2150 transitions. [2025-03-17 05:48:16,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:48:16,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:16,836 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, 1, 1, 1] [2025-03-17 05:48:16,844 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 (27)] Ended with exit code 0 [2025-03-17 05:48:17,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:17,037 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:17,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:17,037 INFO L85 PathProgramCache]: Analyzing trace with hash 501473705, now seen corresponding path program 1 times [2025-03-17 05:48:17,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:17,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009834784] [2025-03-17 05:48:17,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:17,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:17,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:17,039 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:17,040 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 (28)] Waiting until timeout for monitored process [2025-03-17 05:48:17,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:48:17,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:48:17,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:17,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:17,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:48:17,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:17,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 05:48:17,603 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 05:48:17,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:48:17,699 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-17 05:48:17,699 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:17,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009834784] [2025-03-17 05:48:17,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009834784] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:48:17,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:48:17,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2025-03-17 05:48:17,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761359358] [2025-03-17 05:48:17,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:17,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:48:17,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:17,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:48:17,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:48:17,700 INFO L87 Difference]: Start difference. First operand 1698 states and 2150 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-17 05:48:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:17,844 INFO L93 Difference]: Finished difference Result 2765 states and 3509 transitions. [2025-03-17 05:48:17,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:48:17,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 93 [2025-03-17 05:48:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:17,849 INFO L225 Difference]: With dead ends: 2765 [2025-03-17 05:48:17,849 INFO L226 Difference]: Without dead ends: 1336 [2025-03-17 05:48:17,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:48:17,852 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 21 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:17,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 346 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:17,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2025-03-17 05:48:17,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1334. [2025-03-17 05:48:17,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1146 states have (on average 1.212914485165794) internal successors, (1390), 1160 states have internal predecessors, (1390), 142 states have call successors, (142), 45 states have call predecessors, (142), 45 states have return successors, (142), 128 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-17 05:48:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1674 transitions. [2025-03-17 05:48:17,952 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1674 transitions. Word has length 93 [2025-03-17 05:48:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:17,953 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1674 transitions. [2025-03-17 05:48:17,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-17 05:48:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1674 transitions. [2025-03-17 05:48:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:48:17,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:17,954 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, 1, 1, 1] [2025-03-17 05:48:17,962 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 (28)] Ended with exit code 0 [2025-03-17 05:48:18,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:18,158 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:18,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1508630136, now seen corresponding path program 1 times [2025-03-17 05:48:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:18,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922453120] [2025-03-17 05:48:18,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:18,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:18,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:18,161 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:18,163 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 (29)] Waiting until timeout for monitored process [2025-03-17 05:48:18,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:48:18,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:48:18,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:18,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:18,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:48:18,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:48:18,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-17 05:48:18,385 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-17 05:48:18,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:48:18,386 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:48:18,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922453120] [2025-03-17 05:48:18,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922453120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:48:18,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:48:18,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:48:18,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529613246] [2025-03-17 05:48:18,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:48:18,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:48:18,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:48:18,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:48:18,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:48:18,387 INFO L87 Difference]: Start difference. First operand 1334 states and 1674 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-17 05:48:18,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:48:18,484 INFO L93 Difference]: Finished difference Result 2441 states and 3079 transitions. [2025-03-17 05:48:18,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:48:18,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 93 [2025-03-17 05:48:18,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:48:18,489 INFO L225 Difference]: With dead ends: 2441 [2025-03-17 05:48:18,489 INFO L226 Difference]: Without dead ends: 1334 [2025-03-17 05:48:18,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:48:18,491 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:48:18,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:48:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-03-17 05:48:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1334. [2025-03-17 05:48:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1146 states have (on average 1.2076788830715532) internal successors, (1384), 1160 states have internal predecessors, (1384), 142 states have call successors, (142), 45 states have call predecessors, (142), 45 states have return successors, (142), 128 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-17 05:48:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1668 transitions. [2025-03-17 05:48:18,585 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1668 transitions. Word has length 93 [2025-03-17 05:48:18,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:48:18,586 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 1668 transitions. [2025-03-17 05:48:18,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-17 05:48:18,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1668 transitions. [2025-03-17 05:48:18,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:48:18,587 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:48:18,587 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, 1, 1, 1] [2025-03-17 05:48:18,594 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 (29)] Ended with exit code 0 [2025-03-17 05:48:18,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:18,790 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:48:18,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:48:18,790 INFO L85 PathProgramCache]: Analyzing trace with hash -815528439, now seen corresponding path program 1 times [2025-03-17 05:48:18,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:48:18,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588057392] [2025-03-17 05:48:18,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:48:18,791 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:48:18,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:48:18,793 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:48:18,793 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 (30)] Waiting until timeout for monitored process [2025-03-17 05:48:18,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:48:18,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:48:18,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:48:18,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:48:18,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:48:18,995 INFO L279 TraceCheckSpWp]: Computing forward predicates...