./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.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 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:48:51,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:48:51,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:48:51,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:48:51,543 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:48:51,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:48:51,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:48:51,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:48:51,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:48:51,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:48:51,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:48:51,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:48:51,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:48:51,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:48:51,567 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:48:51,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:48:51,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:48:51,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:48:51,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:48:51,569 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:48:51,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:48:51,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:48:51,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:48:51,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:48:51,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:48:51,570 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 -> 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 [2025-03-08 16:48:51,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:48:51,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:48:51,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:48:51,807 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:48:51,807 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:48:51,809 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2025-03-08 16:48:52,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d7944fb/0908cc7f48664b04879e60b9da418655/FLAG32b49d754 [2025-03-08 16:48:53,197 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:48:53,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2025-03-08 16:48:53,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d7944fb/0908cc7f48664b04879e60b9da418655/FLAG32b49d754 [2025-03-08 16:48:53,215 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d7944fb/0908cc7f48664b04879e60b9da418655 [2025-03-08 16:48:53,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:48:53,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:48:53,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:48:53,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:48:53,225 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:48:53,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,227 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a3954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53, skipping insertion in model container [2025-03-08 16:48:53,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:48:53,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i[916,929] [2025-03-08 16:48:53,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:48:53,413 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:48:53,421 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i[916,929] [2025-03-08 16:48:53,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:48:53,473 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:48:53,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53 WrapperNode [2025-03-08 16:48:53,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:48:53,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:48:53,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:48:53,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:48:53,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,528 INFO L138 Inliner]: procedures = 30, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 471 [2025-03-08 16:48:53,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:48:53,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:48:53,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:48:53,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:48:53,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,542 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,548 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 16:48:53,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:48:53,567 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:48:53,567 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:48:53,568 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:48:53,568 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (1/1) ... [2025-03-08 16:48:53,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:48:53,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:48:53,595 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-08 16:48:53,597 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-08 16:48:53,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:48:53,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 16:48:53,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 16:48:53,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 16:48:53,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 16:48:53,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 16:48:53,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 16:48:53,612 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:48:53,612 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:48:53,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 16:48:53,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:48:53,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:48:53,693 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:48:53,695 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:48:54,034 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem113#1;havoc property_#t~mem93#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-03-08 16:48:54,061 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-03-08 16:48:54,061 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:48:54,068 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:48:54,069 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:48:54,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:48:54 BoogieIcfgContainer [2025-03-08 16:48:54,070 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:48:54,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:48:54,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:48:54,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:48:54,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:48:53" (1/3) ... [2025-03-08 16:48:54,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ae6327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:48:54, skipping insertion in model container [2025-03-08 16:48:54,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:48:53" (2/3) ... [2025-03-08 16:48:54,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58ae6327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:48:54, skipping insertion in model container [2025-03-08 16:48:54,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:48:54" (3/3) ... [2025-03-08 16:48:54,078 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-26.i [2025-03-08 16:48:54,088 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:48:54,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-26.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:48:54,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:48:54,135 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;@70a17fa6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:48:54,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:48:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 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-08 16:48:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:48:54,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:48:54,148 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:48:54,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:48:54,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:48:54,151 INFO L85 PathProgramCache]: Analyzing trace with hash 416688433, now seen corresponding path program 1 times [2025-03-08 16:48:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:48:54,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297204913] [2025-03-08 16:48:54,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:48:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:48:54,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:54,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:54,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:54,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:48:54,417 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-08 16:48:54,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:48:54,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297204913] [2025-03-08 16:48:54,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297204913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:48:54,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033215113] [2025-03-08 16:48:54,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:48:54,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:48:54,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:48:54,420 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-08 16:48:54,422 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-08 16:48:54,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:54,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:54,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:54,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:48:54,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:48:54,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:48:54,619 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-08 16:48:54,619 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:48:54,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033215113] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:48:54,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:48:54,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:48:54,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006088574] [2025-03-08 16:48:54,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:48:54,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:48:54,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:48:54,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:48:54,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:48:54,636 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 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) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-08 16:48:54,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:48:54,650 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2025-03-08 16:48:54,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:48:54,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 89 [2025-03-08 16:48:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:48:54,655 INFO L225 Difference]: With dead ends: 178 [2025-03-08 16:48:54,655 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 16:48:54,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-08 16:48:54,659 INFO L435 NwaCegarLoop]: 127 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, 127 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-08 16:48:54,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:48:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 16:48:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 16:48:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 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-08 16:48:54,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-03-08 16:48:54,692 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2025-03-08 16:48:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:48:54,692 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-03-08 16:48:54,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-08 16:48:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-03-08 16:48:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:48:54,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:48:54,695 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:48:54,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:48:54,896 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-08 16:48:54,896 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:48:54,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:48:54,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1588344810, now seen corresponding path program 1 times [2025-03-08 16:48:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:48:54,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510196302] [2025-03-08 16:48:54,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:48:54,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:48:54,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:54,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:54,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:54,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:48:55,117 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-08 16:48:55,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:48:55,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510196302] [2025-03-08 16:48:55,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510196302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:48:55,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:48:55,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:48:55,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272655700] [2025-03-08 16:48:55,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:48:55,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:48:55,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:48:55,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:48:55,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:48:55,119 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:48:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:48:55,153 INFO L93 Difference]: Finished difference Result 177 states and 254 transitions. [2025-03-08 16:48:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:48:55,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-03-08 16:48:55,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:48:55,155 INFO L225 Difference]: With dead ends: 177 [2025-03-08 16:48:55,155 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:48:55,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:48:55,156 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:48:55,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:48:55,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:48:55,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 16:48:55,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3875) internal successors, (111), 80 states have internal predecessors, (111), 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-08 16:48:55,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2025-03-08 16:48:55,169 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 89 [2025-03-08 16:48:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:48:55,170 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2025-03-08 16:48:55,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:48:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2025-03-08 16:48:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:48:55,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:48:55,171 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:48:55,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:48:55,172 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:48:55,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:48:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash -597589237, now seen corresponding path program 1 times [2025-03-08 16:48:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:48:55,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101551016] [2025-03-08 16:48:55,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:48:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:48:55,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:55,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:55,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:55,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:48:55,376 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-08 16:48:55,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:48:55,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101551016] [2025-03-08 16:48:55,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101551016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:48:55,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:48:55,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:48:55,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290606846] [2025-03-08 16:48:55,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:48:55,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:48:55,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:48:55,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:48:55,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:48:55,378 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:48:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:48:55,412 INFO L93 Difference]: Finished difference Result 182 states and 259 transitions. [2025-03-08 16:48:55,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:48:55,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-03-08 16:48:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:48:55,414 INFO L225 Difference]: With dead ends: 182 [2025-03-08 16:48:55,414 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 16:48:55,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:48:55,415 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 363 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-08 16:48:55,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 363 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:48:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 16:48:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-03-08 16:48:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 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-08 16:48:55,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2025-03-08 16:48:55,423 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 89 [2025-03-08 16:48:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:48:55,424 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2025-03-08 16:48:55,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:48:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2025-03-08 16:48:55,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:48:55,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:48:55,425 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:48:55,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:48:55,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:48:55,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:48:55,425 INFO L85 PathProgramCache]: Analyzing trace with hash -596665716, now seen corresponding path program 1 times [2025-03-08 16:48:55,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:48:55,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419953978] [2025-03-08 16:48:55,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:48:55,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:48:55,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:55,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:55,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:55,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:48:55,651 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-08 16:48:55,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:48:55,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419953978] [2025-03-08 16:48:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419953978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:48:55,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:48:55,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:48:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5560603] [2025-03-08 16:48:55,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:48:55,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:48:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:48:55,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:48:55,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:48:55,653 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:48:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:48:55,671 INFO L93 Difference]: Finished difference Result 183 states and 259 transitions. [2025-03-08 16:48:55,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:48:55,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-03-08 16:48:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:48:55,672 INFO L225 Difference]: With dead ends: 183 [2025-03-08 16:48:55,672 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 16:48:55,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 16:48:55,673 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 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-08 16:48:55,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:48:55,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 16:48:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 16:48:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 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-08 16:48:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-03-08 16:48:55,682 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 89 [2025-03-08 16:48:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:48:55,683 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-03-08 16:48:55,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:48:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-03-08 16:48:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:48:55,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:48:55,686 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:48:55,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:48:55,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:48:55,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:48:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1005489941, now seen corresponding path program 1 times [2025-03-08 16:48:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:48:55,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725616325] [2025-03-08 16:48:55,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:48:55,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:48:55,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:55,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:55,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:55,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:48:55,858 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-08 16:48:55,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:48:55,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725616325] [2025-03-08 16:48:55,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725616325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:48:55,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:48:55,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:48:55,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466467] [2025-03-08 16:48:55,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:48:55,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:48:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:48:55,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:48:55,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:48:55,860 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:48:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:48:55,975 INFO L93 Difference]: Finished difference Result 183 states and 257 transitions. [2025-03-08 16:48:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:48:55,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-03-08 16:48:55,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:48:55,976 INFO L225 Difference]: With dead ends: 183 [2025-03-08 16:48:55,977 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 16:48:55,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-08 16:48:55,979 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:48:55,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:48:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 16:48:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-08 16:48:55,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 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-08 16:48:55,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2025-03-08 16:48:55,987 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 89 [2025-03-08 16:48:55,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:48:55,987 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2025-03-08 16:48:55,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:48:55,987 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2025-03-08 16:48:55,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:48:55,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:48:55,988 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:48:55,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:48:55,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:48:55,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:48:55,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1511048566, now seen corresponding path program 1 times [2025-03-08 16:48:55,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:48:55,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827841898] [2025-03-08 16:48:55,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:48:55,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:48:56,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:56,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:56,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:56,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:48:57,688 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-08 16:48:57,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:48:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827841898] [2025-03-08 16:48:57,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827841898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:48:57,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637635220] [2025-03-08 16:48:57,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:48:57,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:48:57,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:48:57,691 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-08 16:48:57,693 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-08 16:48:57,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:57,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:57,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:57,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:48:57,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 16:48:57,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:48:57,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:48:57,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:48:57,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-03-08 16:48:57,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:48:57,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22 [2025-03-08 16:48:57,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:48:57,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2025-03-08 16:48:58,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:48:58,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 17 [2025-03-08 16:48:58,169 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-08 16:48:58,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:48:58,380 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-08 16:48:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637635220] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:48:58,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:48:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16, 11] total 27 [2025-03-08 16:48:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653812342] [2025-03-08 16:48:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:48:58,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:48:58,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:48:58,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:48:58,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=629, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:48:58,382 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:48:58,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:48:58,950 INFO L93 Difference]: Finished difference Result 275 states and 384 transitions. [2025-03-08 16:48:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:48:58,951 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-03-08 16:48:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:48:58,952 INFO L225 Difference]: With dead ends: 275 [2025-03-08 16:48:58,952 INFO L226 Difference]: Without dead ends: 185 [2025-03-08 16:48:58,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2025-03-08 16:48:58,953 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 111 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:48:58,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 730 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:48:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-03-08 16:48:58,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 103. [2025-03-08 16:48:58,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 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-08 16:48:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 142 transitions. [2025-03-08 16:48:58,962 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 142 transitions. Word has length 89 [2025-03-08 16:48:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:48:58,963 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 142 transitions. [2025-03-08 16:48:58,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:48:58,963 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 142 transitions. [2025-03-08 16:48:58,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:48:58,964 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:48:58,964 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:48:58,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:48:59,164 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,SelfDestructingSolverStorable5 [2025-03-08 16:48:59,165 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:48:59,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:48:59,165 INFO L85 PathProgramCache]: Analyzing trace with hash 285902793, now seen corresponding path program 1 times [2025-03-08 16:48:59,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:48:59,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563071497] [2025-03-08 16:48:59,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:48:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:48:59,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:59,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:59,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:59,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 16:48:59,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1332082561] [2025-03-08 16:48:59,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:48:59,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:48:59,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:48:59,241 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-08 16:48:59,243 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-08 16:48:59,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:59,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:59,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:59,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:48:59,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:48:59,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:48:59,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:48:59,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:48:59,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:48:59,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:48:59,868 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:48:59,869 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:48:59,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:49:00,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:49:00,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:00,112 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:49:00,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:49:00 BoogieIcfgContainer [2025-03-08 16:49:00,116 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:49:00,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:49:00,116 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:49:00,117 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:49:00,117 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:48:54" (3/4) ... [2025-03-08 16:49:00,119 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:49:00,120 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:49:00,122 INFO L158 Benchmark]: Toolchain (without parser) took 6901.69ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 123.3MB in the beginning and 225.4MB in the end (delta: -102.1MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2025-03-08 16:49:00,122 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:49:00,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.29ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 107.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:49:00,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.60ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:49:00,122 INFO L158 Benchmark]: Boogie Preprocessor took 34.70ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 99.5MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:49:00,122 INFO L158 Benchmark]: IcfgBuilder took 502.80ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 66.0MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:49:00,123 INFO L158 Benchmark]: TraceAbstraction took 6044.08ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 65.4MB in the beginning and 225.5MB in the end (delta: -160.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2025-03-08 16:49:00,123 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 335.5MB. Free memory was 225.5MB in the beginning and 225.4MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:49:00,124 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.51ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.29ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 107.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.60ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 103.1MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.70ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 99.5MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 502.80ms. Allocated memory is still 167.8MB. Free memory was 99.5MB in the beginning and 66.0MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6044.08ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 65.4MB in the beginning and 225.5MB in the end (delta: -160.1MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 335.5MB. Free memory was 225.5MB in the beginning and 225.4MB in the end (delta: 69.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 86, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { -1, 1, 1.125, 199.5, 100000000000000.3, 64, 2, 50, -32, 8.75 }; [L47] unsigned char last_1_WrapperStruct00_var_1_15 = 64; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_15=64] [L90] isInitial = 1 [L91] FCALL initially() [L92] COND TRUE 1 [L93] CALL updateLastVariables() [L83] EXPR WrapperStruct00.var_1_15 [L83] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L93] RET updateLastVariables() [L94] CALL updateVariables() [L67] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L68] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L68] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L68] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L69] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L69] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L69] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L70] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L71] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L72] WrapperStruct00.var_1_14 = __VERIFIER_nondet_float() [L73] EXPR WrapperStruct00.var_1_14 [L73] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L73] EXPR WrapperStruct00.var_1_14 [L73] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L73] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L74] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L75] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L75] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L75] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L76] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L76] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L76] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L77] WrapperStruct00.var_1_19 = __VERIFIER_nondet_long() [L78] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L78] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L79] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] CALL assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L80] RET assume_abort_if_not(WrapperStruct00.var_1_19 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L94] RET updateVariables() [L95] CALL step() [L51] EXPR WrapperStruct00.var_1_13 [L51] EXPR WrapperStruct00.var_1_14 [L51] WrapperStruct00.var_1_12 = ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14) [L52] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L52] COND TRUE (- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4)))) [L53] EXPR WrapperStruct00.var_1_16 [L53] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L55] EXPR WrapperStruct00.var_1_13 [L55] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_13 [L56] EXPR WrapperStruct00.var_1_20 [L56] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L56] COND TRUE WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20 [L57] EXPR WrapperStruct00.var_1_15 [L57] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L57] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L57] EXPR WrapperStruct00.var_1_15 [L57] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L57] WrapperStruct00.var_1_1 = ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))) [L61] EXPR WrapperStruct00.var_1_15 [L61] EXPR WrapperStruct00.var_1_15 [L61] EXPR WrapperStruct00.var_1_1 [L61] signed long int stepLocal_0 = WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1); [L62] EXPR WrapperStruct00.var_1_15 [L62] EXPR WrapperStruct00.var_1_1 [L62] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64, stepLocal_0=0] [L62] COND FALSE !(stepLocal_0 != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) [L95] RET step() [L96] CALL, EXPR property() [L86] EXPR WrapperStruct00.var_1_20 [L86] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))))))) [L86] EXPR WrapperStruct00.var_1_1 [L86] EXPR WrapperStruct00.var_1_15 [L86] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) [L86] EXPR WrapperStruct00.var_1_15 [L86] EXPR ((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14))) [L86] EXPR WrapperStruct00.var_1_12 [L86] EXPR WrapperStruct00.var_1_13 [L86] EXPR WrapperStruct00.var_1_14 [L86] EXPR ((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR ((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86] EXPR (((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L86-L87] return (((((WrapperStruct00.var_1_20 > WrapperStruct00.var_1_20) ? (WrapperStruct00.var_1_1 == ((signed short int) ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) < ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))) ? ((WrapperStruct00.var_1_15 - ((((WrapperStruct00.var_1_15) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15))))) : ((WrapperStruct00.var_1_15 + ((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_15)))))))))) && (WrapperStruct00.var_1_12 == ((float) ((0.85f - WrapperStruct00.var_1_13) + WrapperStruct00.var_1_14)))) && (((- last_1_WrapperStruct00_var_1_15) >= (WrapperStruct00.var_1_4 / ((((-4) < 0 ) ? -(-4) : (-4))))) ? (WrapperStruct00.var_1_15 == ((unsigned char) WrapperStruct00.var_1_16)) : 1)) && (((WrapperStruct00.var_1_15 + (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_1)) != (WrapperStruct00.var_1_15 * (WrapperStruct00.var_1_1 / WrapperStruct00.var_1_19))) ? (WrapperStruct00.var_1_17 == ((unsigned long int) (((((10u) < ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15))) ? (10u) : ((WrapperStruct00.var_1_1 + WrapperStruct00.var_1_15)))) + WrapperStruct00.var_1_15))) : 1)) && (WrapperStruct00.var_1_20 == ((float) WrapperStruct00.var_1_13)) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 141 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 7, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 2014 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1258 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 756 mSDtfsCounter, 673 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 308 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=6, InterpolantAutomatonStates: 25, 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, 6 MinimizatonAttempts, 83 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 890 NumberOfCodeBlocks, 890 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 792 ConstructedInterpolants, 0 QuantifiedInterpolants, 1551 SizeOfPredicates, 7 NumberOfNonLiveVariables, 706 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 1259/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-08 16:49:00,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.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 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:49:01,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:49:02,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:49:02,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:49:02,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:49:02,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:49:02,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:49:02,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:49:02,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:49:02,065 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:49:02,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:49:02,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:49:02,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:49:02,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:49:02,066 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:49:02,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:49:02,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:49:02,067 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:49:02,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:49:02,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:49:02,068 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:49:02,068 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:49:02,068 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:49:02,068 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:49:02,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:49:02,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:49:02,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:49:02,068 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:49:02,068 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 -> 4f32f3e0457a6141f1106de27eaab44d0716424a3dba3667fc2cbc28838d3ee1 [2025-03-08 16:49:02,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:49:02,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:49:02,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:49:02,311 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:49:02,311 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:49:02,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2025-03-08 16:49:03,476 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08d9f8ea/156108dbe75c4ef1902908606b182243/FLAG0ff50f937 [2025-03-08 16:49:03,664 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:49:03,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i [2025-03-08 16:49:03,671 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08d9f8ea/156108dbe75c4ef1902908606b182243/FLAG0ff50f937 [2025-03-08 16:49:04,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d08d9f8ea/156108dbe75c4ef1902908606b182243 [2025-03-08 16:49:04,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:49:04,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:49:04,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:49:04,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:49:04,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:49:04,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1edd0f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04, skipping insertion in model container [2025-03-08 16:49:04,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:49:04,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i[916,929] [2025-03-08 16:49:04,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:49:04,216 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:49:04,225 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-26.i[916,929] [2025-03-08 16:49:04,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:49:04,289 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:49:04,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04 WrapperNode [2025-03-08 16:49:04,290 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:49:04,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:49:04,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:49:04,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:49:04,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,350 INFO L138 Inliner]: procedures = 37, calls = 150, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 468 [2025-03-08 16:49:04,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:49:04,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:49:04,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:49:04,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:49:04,356 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,361 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,374 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 22 writes are split as follows [0, 22]. [2025-03-08 16:49:04,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,388 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,395 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:49:04,396 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:49:04,396 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:49:04,396 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:49:04,400 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (1/1) ... [2025-03-08 16:49:04,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:49:04,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:49:04,430 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-08 16:49:04,432 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-08 16:49:04,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:49:04,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:49:04,449 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:49:04,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:49:04,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:49:04,546 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:49:04,547 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:49:05,414 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L86: havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite114#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~mem113#1;havoc property_#t~mem93#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite92#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite112#1;havoc property_#t~mem105#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short118#1;havoc property_#t~mem119#1;havoc property_#t~ite122#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short123#1;havoc property_#t~mem126#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-03-08 16:49:05,462 INFO L? ?]: Removed 160 outVars from TransFormulas that were not future-live. [2025-03-08 16:49:05,462 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:49:05,472 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:49:05,473 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:49:05,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:05 BoogieIcfgContainer [2025-03-08 16:49:05,473 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:49:05,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:49:05,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:49:05,478 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:49:05,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:49:04" (1/3) ... [2025-03-08 16:49:05,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f714d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:49:05, skipping insertion in model container [2025-03-08 16:49:05,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:49:04" (2/3) ... [2025-03-08 16:49:05,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53f714d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:49:05, skipping insertion in model container [2025-03-08 16:49:05,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:49:05" (3/3) ... [2025-03-08 16:49:05,480 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-26.i [2025-03-08 16:49:05,490 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:49:05,491 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-26.i that has 2 procedures, 92 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:49:05,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:49:05,539 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;@33a21177, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:49:05,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:49:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 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-08 16:49:05,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:49:05,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:05,552 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:05,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:05,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:05,557 INFO L85 PathProgramCache]: Analyzing trace with hash 2095636372, now seen corresponding path program 1 times [2025-03-08 16:49:05,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:05,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166169736] [2025-03-08 16:49:05,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:05,567 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-08 16:49:05,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:05,569 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-08 16:49:05,570 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-08 16:49:05,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:49:05,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:49:05,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:05,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:05,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:49:05,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:05,910 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-08 16:49:05,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:05,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:05,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166169736] [2025-03-08 16:49:05,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166169736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:05,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:49:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085075233] [2025-03-08 16:49:05,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:05,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:49:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:05,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:49:05,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:49:05,932 INFO L87 Difference]: Start difference. First operand has 92 states, 80 states have (on average 1.425) internal successors, (114), 81 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) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-08 16:49:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:05,954 INFO L93 Difference]: Finished difference Result 178 states and 268 transitions. [2025-03-08 16:49:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:49:05,956 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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 89 [2025-03-08 16:49:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:05,960 INFO L225 Difference]: With dead ends: 178 [2025-03-08 16:49:05,961 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 16:49:05,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 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-08 16:49:05,966 INFO L435 NwaCegarLoop]: 127 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, 127 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-08 16:49:05,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 16:49:05,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 16:49:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 78 states have internal predecessors, (109), 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-08 16:49:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2025-03-08 16:49:05,991 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 89 [2025-03-08 16:49:05,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:05,992 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2025-03-08 16:49:05,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-08 16:49:05,992 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2025-03-08 16:49:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:49:05,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:05,994 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:06,005 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-08 16:49:06,195 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-08 16:49:06,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:06,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:06,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1027674547, now seen corresponding path program 1 times [2025-03-08 16:49:06,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:06,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575743334] [2025-03-08 16:49:06,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:06,197 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-08 16:49:06,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:06,199 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-08 16:49:06,199 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-08 16:49:06,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:49:06,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:49:06,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:06,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:06,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:06,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:06,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 16:49:06,577 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-08 16:49:06,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:06,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:06,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575743334] [2025-03-08 16:49:06,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [575743334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:06,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:06,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:06,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244207612] [2025-03-08 16:49:06,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:06,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:06,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:06,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:06,583 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:06,804 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2025-03-08 16:49:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:06,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-03-08 16:49:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:06,806 INFO L225 Difference]: With dead ends: 175 [2025-03-08 16:49:06,807 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 16:49:06,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 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-08 16:49:06,808 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:06,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 16:49:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 16:49:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 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-08 16:49:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2025-03-08 16:49:06,816 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 89 [2025-03-08 16:49:06,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:06,816 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2025-03-08 16:49:06,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:06,817 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2025-03-08 16:49:06,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:49:06,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:06,818 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:06,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:49:07,018 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-08 16:49:07,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:07,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:07,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1436498772, now seen corresponding path program 1 times [2025-03-08 16:49:07,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:07,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931477565] [2025-03-08 16:49:07,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:07,020 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-08 16:49:07,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:07,021 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-08 16:49:07,023 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-08 16:49:07,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:49:07,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:49:07,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:07,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:07,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:49:07,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:07,335 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-08 16:49:07,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:07,336 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:07,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931477565] [2025-03-08 16:49:07,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931477565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:07,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:07,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:49:07,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14574290] [2025-03-08 16:49:07,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:07,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:49:07,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:07,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:49:07,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:49:07,338 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:07,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:07,399 INFO L93 Difference]: Finished difference Result 180 states and 256 transitions. [2025-03-08 16:49:07,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:49:07,400 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 89 [2025-03-08 16:49:07,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:07,401 INFO L225 Difference]: With dead ends: 180 [2025-03-08 16:49:07,401 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 16:49:07,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:49:07,402 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 471 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-08 16:49:07,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 471 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 16:49:07,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-03-08 16:49:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 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-08 16:49:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-03-08 16:49:07,408 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 89 [2025-03-08 16:49:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:07,408 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-03-08 16:49:07,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-03-08 16:49:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-03-08 16:49:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 16:49:07,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:07,409 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:07,421 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-08 16:49:07,609 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-08 16:49:07,610 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:07,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:07,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1435575251, now seen corresponding path program 1 times [2025-03-08 16:49:07,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:07,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372609722] [2025-03-08 16:49:07,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:07,614 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-08 16:49:07,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:07,616 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-08 16:49:07,616 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-08 16:49:07,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 16:49:07,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 16:49:07,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:07,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:07,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:49:07,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:07,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-03-08 16:49:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-08 16:49:07,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:07,987 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:07,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372609722] [2025-03-08 16:49:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372609722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:07,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:07,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:49:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522694402] [2025-03-08 16:49:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:07,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:49:07,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:07,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:49:07,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:49:07,992 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:49:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:08,868 INFO L93 Difference]: Finished difference Result 184 states and 258 transitions. [2025-03-08 16:49:08,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:49:08,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2025-03-08 16:49:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:08,870 INFO L225 Difference]: With dead ends: 184 [2025-03-08 16:49:08,870 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 16:49:08,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:49:08,871 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 111 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:08,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 379 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 16:49:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 16:49:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2025-03-08 16:49:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 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-08 16:49:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2025-03-08 16:49:08,878 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 89 [2025-03-08 16:49:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:08,878 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2025-03-08 16:49:08,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-08 16:49:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2025-03-08 16:49:08,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 16:49:08,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:08,879 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] [2025-03-08 16:49:08,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:49:09,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:49:09,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:09,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1564397679, now seen corresponding path program 1 times [2025-03-08 16:49:09,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:09,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235934044] [2025-03-08 16:49:09,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:09,082 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-08 16:49:09,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:09,086 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:49:09,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:49:09,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 16:49:09,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 16:49:09,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:09,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:09,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:09,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:09,398 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 55 treesize of output 19 [2025-03-08 16:49:09,415 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-08 16:49:09,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:09,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:09,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235934044] [2025-03-08 16:49:09,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235934044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:09,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:09,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025901354] [2025-03-08 16:49:09,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:09,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:09,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:09,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:09,418 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-08 16:49:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:09,691 INFO L93 Difference]: Finished difference Result 181 states and 253 transitions. [2025-03-08 16:49:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:09,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 91 [2025-03-08 16:49:09,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:09,693 INFO L225 Difference]: With dead ends: 181 [2025-03-08 16:49:09,693 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:49:09,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 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-08 16:49:09,694 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:09,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:49:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:49:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 16:49:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.35) internal successors, (108), 80 states have internal predecessors, (108), 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-08 16:49:09,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2025-03-08 16:49:09,700 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 91 [2025-03-08 16:49:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:09,701 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2025-03-08 16:49:09,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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-08 16:49:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2025-03-08 16:49:09,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:49:09,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:09,701 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, 1, 1, 1] [2025-03-08 16:49:09,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-08 16:49:09,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:49:09,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:09,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:09,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1260197109, now seen corresponding path program 1 times [2025-03-08 16:49:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:09,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388233120] [2025-03-08 16:49:09,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:09,903 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-08 16:49:09,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:09,905 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-08 16:49:09,905 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-08 16:49:09,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:49:10,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:49:10,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:10,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:10,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:10,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:10,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 16:49:10,197 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-08 16:49:10,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:10,198 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:10,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388233120] [2025-03-08 16:49:10,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388233120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:10,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:10,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:10,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810848066] [2025-03-08 16:49:10,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:10,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:10,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:10,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:10,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:10,199 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08 16:49:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:10,466 INFO L93 Difference]: Finished difference Result 179 states and 249 transitions. [2025-03-08 16:49:10,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:10,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 96 [2025-03-08 16:49:10,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:10,469 INFO L225 Difference]: With dead ends: 179 [2025-03-08 16:49:10,469 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:49:10,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-08 16:49:10,469 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 236 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.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:10,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 236 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:49:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:49:10,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 16:49:10,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 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-08 16:49:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2025-03-08 16:49:10,473 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 96 [2025-03-08 16:49:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:10,474 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2025-03-08 16:49:10,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08 16:49:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2025-03-08 16:49:10,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:49:10,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:10,480 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, 1, 1, 1] [2025-03-08 16:49:10,491 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-08 16:49:10,680 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-08 16:49:10,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:10,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash -817012234, now seen corresponding path program 1 times [2025-03-08 16:49:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074993640] [2025-03-08 16:49:10,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:10,682 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-08 16:49:10,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:10,683 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-08 16:49:10,684 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-08 16:49:10,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:49:11,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:49:11,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:11,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:11,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:11,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:11,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 16:49:11,052 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-08 16:49:11,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:11,052 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:11,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074993640] [2025-03-08 16:49:11,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074993640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:11,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:11,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:11,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561971110] [2025-03-08 16:49:11,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:11,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:11,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:11,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:11,053 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08 16:49:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:11,291 INFO L93 Difference]: Finished difference Result 179 states and 247 transitions. [2025-03-08 16:49:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:11,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 96 [2025-03-08 16:49:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:11,292 INFO L225 Difference]: With dead ends: 179 [2025-03-08 16:49:11,292 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:49:11,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-08 16:49:11,293 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:11,293 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.2s Time] [2025-03-08 16:49:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:49:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 16:49:11,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 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-08 16:49:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2025-03-08 16:49:11,297 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 96 [2025-03-08 16:49:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:11,297 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2025-03-08 16:49:11,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08 16:49:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2025-03-08 16:49:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:49:11,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:11,301 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, 1, 1, 1] [2025-03-08 16:49:11,311 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-08 16:49:11,502 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-08 16:49:11,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:11,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:11,502 INFO L85 PathProgramCache]: Analyzing trace with hash 427752247, now seen corresponding path program 1 times [2025-03-08 16:49:11,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:11,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844979329] [2025-03-08 16:49:11,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:11,503 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-08 16:49:11,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:11,504 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-08 16:49:11,505 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-08 16:49:11,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:49:11,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:49:11,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:11,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:11,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:11,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:11,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 16:49:11,862 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-08 16:49:11,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:11,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:11,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844979329] [2025-03-08 16:49:11,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844979329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:11,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:11,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:11,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841024968] [2025-03-08 16:49:11,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:11,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:11,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:11,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:11,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:11,863 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08 16:49:12,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:12,108 INFO L93 Difference]: Finished difference Result 179 states and 245 transitions. [2025-03-08 16:49:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:12,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 96 [2025-03-08 16:49:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:12,110 INFO L225 Difference]: With dead ends: 179 [2025-03-08 16:49:12,110 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:49:12,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-08 16:49:12,111 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 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.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:12,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:49:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:49:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 16:49:12,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3125) internal successors, (105), 80 states have internal predecessors, (105), 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-08 16:49:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2025-03-08 16:49:12,119 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 96 [2025-03-08 16:49:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:12,119 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2025-03-08 16:49:12,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08 16:49:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2025-03-08 16:49:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:49:12,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:12,120 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, 1, 1, 1] [2025-03-08 16:49:12,130 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-08 16:49:12,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:49:12,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:12,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash 639103160, now seen corresponding path program 1 times [2025-03-08 16:49:12,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:12,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877311037] [2025-03-08 16:49:12,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:12,321 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-08 16:49:12,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:12,323 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:49:12,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-08 16:49:12,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:49:12,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:49:12,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:12,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:12,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:12,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:12,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 16:49:12,649 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-08 16:49:12,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:12,649 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:12,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877311037] [2025-03-08 16:49:12,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877311037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:12,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:12,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:12,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730342756] [2025-03-08 16:49:12,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:12,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:12,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:12,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:12,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:12,650 INFO L87 Difference]: Start difference. First operand 91 states and 123 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08 16:49:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:12,664 INFO L93 Difference]: Finished difference Result 179 states and 243 transitions. [2025-03-08 16:49:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 96 [2025-03-08 16:49:12,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:12,665 INFO L225 Difference]: With dead ends: 179 [2025-03-08 16:49:12,665 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 16:49:12,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-08 16:49:12,666 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 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-08 16:49:12,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:12,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 16:49:12,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-03-08 16:49:12,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 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-08 16:49:12,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 122 transitions. [2025-03-08 16:49:12,669 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 122 transitions. Word has length 96 [2025-03-08 16:49:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:12,669 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 122 transitions. [2025-03-08 16:49:12,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08 16:49:12,669 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 122 transitions. [2025-03-08 16:49:12,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 16:49:12,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:12,670 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, 1, 1, 1] [2025-03-08 16:49:12,685 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 (10)] Forceful destruction successful, exit code 0 [2025-03-08 16:49:12,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:49:12,871 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:12,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:12,871 INFO L85 PathProgramCache]: Analyzing trace with hash 133544535, now seen corresponding path program 1 times [2025-03-08 16:49:12,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:12,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936934930] [2025-03-08 16:49:12,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:12,871 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-08 16:49:12,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:12,873 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-08 16:49:12,874 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-08 16:49:12,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 16:49:13,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 16:49:13,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:13,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:13,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:13,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:13,204 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 55 treesize of output 19 [2025-03-08 16:49:13,218 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-08 16:49:13,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:13,218 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:13,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936934930] [2025-03-08 16:49:13,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936934930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:13,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:13,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:13,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895732521] [2025-03-08 16:49:13,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:13,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:13,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:13,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:13,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:13,219 INFO L87 Difference]: Start difference. First operand 91 states and 122 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08 16:49:13,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:13,235 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2025-03-08 16:49:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 96 [2025-03-08 16:49:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:13,236 INFO L225 Difference]: With dead ends: 177 [2025-03-08 16:49:13,236 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 16:49:13,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 94 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-08 16:49:13,237 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:13,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 16:49:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2025-03-08 16:49:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 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-08 16:49:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2025-03-08 16:49:13,240 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 96 [2025-03-08 16:49:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:13,240 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2025-03-08 16:49:13,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-08 16:49:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2025-03-08 16:49:13,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:49:13,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:13,241 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:13,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-08 16:49:13,441 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-08 16:49:13,442 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:13,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:13,442 INFO L85 PathProgramCache]: Analyzing trace with hash 382912019, now seen corresponding path program 1 times [2025-03-08 16:49:13,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:13,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192645112] [2025-03-08 16:49:13,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:13,442 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-08 16:49:13,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:13,444 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-08 16:49:13,445 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-08 16:49:13,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:49:13,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:49:13,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:13,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:13,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 16:49:13,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:13,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 40 [2025-03-08 16:49:14,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:49:14,131 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 59 treesize of output 27 [2025-03-08 16:49:14,452 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-08 16:49:14,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:14,452 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:14,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192645112] [2025-03-08 16:49:14,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192645112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:14,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:14,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-08 16:49:14,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156574848] [2025-03-08 16:49:14,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:14,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 16:49:14,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:14,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 16:49:14,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:49:14,454 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 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-08 16:49:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:18,154 INFO L93 Difference]: Finished difference Result 265 states and 355 transitions. [2025-03-08 16:49:18,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 16:49:18,155 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 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 101 [2025-03-08 16:49:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:18,156 INFO L225 Difference]: With dead ends: 265 [2025-03-08 16:49:18,156 INFO L226 Difference]: Without dead ends: 179 [2025-03-08 16:49:18,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-03-08 16:49:18,157 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 107 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:18,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 964 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 974 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2025-03-08 16:49:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-08 16:49:18,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2025-03-08 16:49:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 151 states have internal predecessors, (195), 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-08 16:49:18,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2025-03-08 16:49:18,168 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 101 [2025-03-08 16:49:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:18,170 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2025-03-08 16:49:18,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 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-08 16:49:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2025-03-08 16:49:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:49:18,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:18,171 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:18,182 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-08 16:49:18,372 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-08 16:49:18,372 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:18,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:18,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1414039340, now seen corresponding path program 1 times [2025-03-08 16:49:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778849320] [2025-03-08 16:49:18,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:18,373 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-08 16:49:18,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:18,375 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-08 16:49:18,376 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-08 16:49:18,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:49:18,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:49:18,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:18,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:18,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:18,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:18,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 16:49:18,665 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-08 16:49:18,665 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:18,665 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:18,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778849320] [2025-03-08 16:49:18,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778849320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:18,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:18,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:18,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708966452] [2025-03-08 16:49:18,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:18,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:18,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:18,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:18,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:18,666 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 16:49:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:18,684 INFO L93 Difference]: Finished difference Result 341 states and 459 transitions. [2025-03-08 16:49:18,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:18,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 101 [2025-03-08 16:49:18,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:18,685 INFO L225 Difference]: With dead ends: 341 [2025-03-08 16:49:18,685 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 16:49:18,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-08 16:49:18,686 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 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-08 16:49:18,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:18,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 16:49:18,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-08 16:49:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.2781456953642385) internal successors, (193), 151 states have internal predecessors, (193), 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-08 16:49:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 229 transitions. [2025-03-08 16:49:18,693 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 229 transitions. Word has length 101 [2025-03-08 16:49:18,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:18,693 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 229 transitions. [2025-03-08 16:49:18,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 16:49:18,693 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 229 transitions. [2025-03-08 16:49:18,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:49:18,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:18,694 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:18,705 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-08 16:49:18,894 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-08 16:49:18,894 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:18,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:18,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2036456085, now seen corresponding path program 1 times [2025-03-08 16:49:18,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:18,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250574310] [2025-03-08 16:49:18,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:18,895 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-08 16:49:18,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:18,897 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-08 16:49:18,899 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-08 16:49:18,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:49:19,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:49:19,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:19,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:19,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:19,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:19,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 16:49:19,211 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-08 16:49:19,211 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:19,211 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250574310] [2025-03-08 16:49:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250574310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:19,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:19,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41658003] [2025-03-08 16:49:19,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:19,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:19,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:19,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:19,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:19,213 INFO L87 Difference]: Start difference. First operand 172 states and 229 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 16:49:19,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:19,232 INFO L93 Difference]: Finished difference Result 341 states and 455 transitions. [2025-03-08 16:49:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:19,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 101 [2025-03-08 16:49:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:19,235 INFO L225 Difference]: With dead ends: 341 [2025-03-08 16:49:19,235 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 16:49:19,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-08 16:49:19,236 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 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-08 16:49:19,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 16:49:19,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-08 16:49:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.2649006622516556) internal successors, (191), 151 states have internal predecessors, (191), 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-08 16:49:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 227 transitions. [2025-03-08 16:49:19,246 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 227 transitions. Word has length 101 [2025-03-08 16:49:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:19,246 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 227 transitions. [2025-03-08 16:49:19,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 16:49:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 227 transitions. [2025-03-08 16:49:19,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:49:19,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:19,247 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:19,257 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-08 16:49:19,447 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-08 16:49:19,447 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:19,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:19,448 INFO L85 PathProgramCache]: Analyzing trace with hash -905201514, now seen corresponding path program 1 times [2025-03-08 16:49:19,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:19,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467109063] [2025-03-08 16:49:19,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:19,448 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-08 16:49:19,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:19,450 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-08 16:49:19,452 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-08 16:49:19,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:49:19,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:49:19,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:19,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:19,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:19,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:19,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 16:49:19,756 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-08 16:49:19,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:19,757 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:19,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467109063] [2025-03-08 16:49:19,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467109063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:19,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:19,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:19,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134993619] [2025-03-08 16:49:19,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:19,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:19,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:19,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:19,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:19,758 INFO L87 Difference]: Start difference. First operand 172 states and 227 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 16:49:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:19,772 INFO L93 Difference]: Finished difference Result 341 states and 451 transitions. [2025-03-08 16:49:19,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:19,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 101 [2025-03-08 16:49:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:19,774 INFO L225 Difference]: With dead ends: 341 [2025-03-08 16:49:19,774 INFO L226 Difference]: Without dead ends: 172 [2025-03-08 16:49:19,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-08 16:49:19,775 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 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-08 16:49:19,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-08 16:49:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2025-03-08 16:49:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.2516556291390728) internal successors, (189), 151 states have internal predecessors, (189), 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-08 16:49:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 225 transitions. [2025-03-08 16:49:19,780 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 225 transitions. Word has length 101 [2025-03-08 16:49:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:19,780 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 225 transitions. [2025-03-08 16:49:19,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 16:49:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 225 transitions. [2025-03-08 16:49:19,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:49:19,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:19,781 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:19,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-03-08 16:49:19,982 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-08 16:49:19,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:19,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:19,982 INFO L85 PathProgramCache]: Analyzing trace with hash 602350295, now seen corresponding path program 1 times [2025-03-08 16:49:19,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:19,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119576462] [2025-03-08 16:49:19,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:19,983 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-08 16:49:19,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:19,985 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-08 16:49:19,985 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-08 16:49:20,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:49:20,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:49:20,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:20,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:20,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 16:49:20,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:22,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:49:22,297 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 97 treesize of output 47 [2025-03-08 16:49:23,766 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-08 16:49:23,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:23,767 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119576462] [2025-03-08 16:49:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119576462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:23,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:23,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:49:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002905897] [2025-03-08 16:49:23,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:23,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:49:23,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:23,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:49:23,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:49:23,768 INFO L87 Difference]: Start difference. First operand 172 states and 225 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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-08 16:49:36,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 16:49:36,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:36,157 INFO L93 Difference]: Finished difference Result 419 states and 545 transitions. [2025-03-08 16:49:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 16:49:36,162 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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 101 [2025-03-08 16:49:36,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:36,163 INFO L225 Difference]: With dead ends: 419 [2025-03-08 16:49:36,163 INFO L226 Difference]: Without dead ends: 245 [2025-03-08 16:49:36,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:49:36,164 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 38 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:49:36,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 600 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 1 Unknown, 0 Unchecked, 10.1s Time] [2025-03-08 16:49:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-08 16:49:36,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 189. [2025-03-08 16:49:36,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 168 states have (on average 1.2321428571428572) internal successors, (207), 168 states have internal predecessors, (207), 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-08 16:49:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 243 transitions. [2025-03-08 16:49:36,174 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 243 transitions. Word has length 101 [2025-03-08 16:49:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:36,175 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 243 transitions. [2025-03-08 16:49:36,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 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-08 16:49:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 243 transitions. [2025-03-08 16:49:36,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:49:36,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:36,176 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:36,187 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-08 16:49:36,376 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-08 16:49:36,376 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:36,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:36,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1074086183, now seen corresponding path program 1 times [2025-03-08 16:49:36,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:36,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001836732] [2025-03-08 16:49:36,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:36,377 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-08 16:49:36,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:36,379 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-08 16:49:36,380 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-08 16:49:36,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 16:49:36,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 16:49:36,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:49:36,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:49:36,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:49:36,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:49:36,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-08 16:49:36,750 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-08 16:49:36,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:49:36,751 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:49:36,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001836732] [2025-03-08 16:49:36,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001836732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:49:36,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:49:36,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:49:36,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757836904] [2025-03-08 16:49:36,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:49:36,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:49:36,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:49:36,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:49:36,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:49:36,752 INFO L87 Difference]: Start difference. First operand 189 states and 243 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 16:49:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:49:36,775 INFO L93 Difference]: Finished difference Result 375 states and 483 transitions. [2025-03-08 16:49:36,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:49:36,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 101 [2025-03-08 16:49:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:49:36,779 INFO L225 Difference]: With dead ends: 375 [2025-03-08 16:49:36,779 INFO L226 Difference]: Without dead ends: 189 [2025-03-08 16:49:36,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 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-08 16:49:36,780 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 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-08 16:49:36,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:49:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-08 16:49:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-08 16:49:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 168 states have (on average 1.2202380952380953) internal successors, (205), 168 states have internal predecessors, (205), 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-08 16:49:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 241 transitions. [2025-03-08 16:49:36,789 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 241 transitions. Word has length 101 [2025-03-08 16:49:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:49:36,789 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 241 transitions. [2025-03-08 16:49:36,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-08 16:49:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 241 transitions. [2025-03-08 16:49:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 16:49:36,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:49:36,791 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:49:36,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-03-08 16:49:36,991 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-08 16:49:36,991 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:49:36,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:49:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 433465626, now seen corresponding path program 1 times [2025-03-08 16:49:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:49:36,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180720314] [2025-03-08 16:49:36,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:49:36,992 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-08 16:49:36,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:49:36,994 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-08 16:49:36,995 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-08 16:49:37,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.