./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.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 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:57:38,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:57:38,382 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:57:38,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:57:38,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:57:38,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:57:38,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:57:38,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:57:38,412 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:57:38,412 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:57:38,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:57:38,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:57:38,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:57:38,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:57:38,414 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:57:38,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:57:38,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:57:38,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:57:38,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:57:38,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:57:38,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:57:38,415 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:57:38,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:57:38,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:57:38,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:57:38,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:57:38,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:57:38,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:57:38,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:57:38,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:57:38,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:57:38,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:57:38,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:57:38,416 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 [2025-03-17 05:57:38,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:57:38,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:57:38,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:57:38,642 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:57:38,642 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:57:38,643 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-43.i [2025-03-17 05:57:39,784 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51de7182d/75c05c1add3e4661a8eff1e764de2976/FLAG8e1bda0fc [2025-03-17 05:57:40,036 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:57:40,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2025-03-17 05:57:40,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51de7182d/75c05c1add3e4661a8eff1e764de2976/FLAG8e1bda0fc [2025-03-17 05:57:40,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51de7182d/75c05c1add3e4661a8eff1e764de2976 [2025-03-17 05:57:40,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:57:40,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:57:40,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:57:40,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:57:40,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:57:40,361 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30326cfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40, skipping insertion in model container [2025-03-17 05:57:40,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:57:40,508 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-43.i[916,929] [2025-03-17 05:57:40,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:57:40,610 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:57:40,618 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-43.i[916,929] [2025-03-17 05:57:40,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:57:40,675 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:57:40,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40 WrapperNode [2025-03-17 05:57:40,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:57:40,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:57:40,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:57:40,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:57:40,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,698 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,735 INFO L138 Inliner]: procedures = 30, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 538 [2025-03-17 05:57:40,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:57:40,737 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:57:40,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:57:40,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:57:40,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,750 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,759 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 05:57:40,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,772 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,773 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:57:40,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:57:40,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:57:40,783 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:57:40,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (1/1) ... [2025-03-17 05:57:40,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:57:40,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:40,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:57:40,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:57:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:57:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 05:57:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 05:57:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 05:57:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 05:57:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 05:57:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 05:57:40,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:57:40,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:57:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 05:57:40,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:57:40,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:57:40,918 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:57:40,919 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:57:41,374 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~mem101#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite100#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite115#1;havoc property_#t~mem102#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem109#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~bitwise118#1;havoc property_#t~ite127#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short128#1;havoc property_#t~mem132#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~bitwise131#1;havoc property_#t~ite137#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1;havoc property_#t~mem146#1;havoc property_#t~mem145#1;havoc property_#t~short147#1; [2025-03-17 05:57:41,413 INFO L? ?]: Removed 131 outVars from TransFormulas that were not future-live. [2025-03-17 05:57:41,413 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:57:41,432 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:57:41,433 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:57:41,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:57:41 BoogieIcfgContainer [2025-03-17 05:57:41,433 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:57:41,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:57:41,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:57:41,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:57:41,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:57:40" (1/3) ... [2025-03-17 05:57:41,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737d00d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:57:41, skipping insertion in model container [2025-03-17 05:57:41,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:57:40" (2/3) ... [2025-03-17 05:57:41,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737d00d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:57:41, skipping insertion in model container [2025-03-17 05:57:41,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:57:41" (3/3) ... [2025-03-17 05:57:41,442 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-43.i [2025-03-17 05:57:41,454 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:57:41,455 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-43.i that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:57:41,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:57:41,525 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;@6401a68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:57:41,526 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:57:41,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:57:41,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:41,544 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:41,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:41,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:41,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1259976275, now seen corresponding path program 1 times [2025-03-17 05:57:41,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:41,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814543382] [2025-03-17 05:57:41,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:41,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:41,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:41,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:41,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:41,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 05:57:41,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:41,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814543382] [2025-03-17 05:57:41,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814543382] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:57:41,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615657847] [2025-03-17 05:57:41,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:41,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:41,909 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:57:41,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:57:42,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:42,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:42,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:42,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:42,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:57:42,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:57:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-17 05:57:42,194 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:57:42,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615657847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:42,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:57:42,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:57:42,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891352553] [2025-03-17 05:57:42,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:42,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:57:42,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:42,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:57:42,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:57:42,216 INFO L87 Difference]: Start difference. First operand has 119 states, 96 states have (on average 1.4479166666666667) internal successors, (139), 97 states have internal predecessors, (139), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:57:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:42,251 INFO L93 Difference]: Finished difference Result 235 states and 376 transitions. [2025-03-17 05:57:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:57:42,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 163 [2025-03-17 05:57:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:42,258 INFO L225 Difference]: With dead ends: 235 [2025-03-17 05:57:42,258 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 05:57:42,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:57:42,262 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 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-17 05:57:42,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:57:42,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 05:57:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-03-17 05:57:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2025-03-17 05:57:42,305 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 175 transitions. Word has length 163 [2025-03-17 05:57:42,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:42,306 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 175 transitions. [2025-03-17 05:57:42,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:57:42,306 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 175 transitions. [2025-03-17 05:57:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:57:42,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:42,308 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:42,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:57:42,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 05:57:42,509 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:42,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:42,510 INFO L85 PathProgramCache]: Analyzing trace with hash 894768803, now seen corresponding path program 1 times [2025-03-17 05:57:42,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:42,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130224059] [2025-03-17 05:57:42,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:42,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:42,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:42,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:42,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:42,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:57:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130224059] [2025-03-17 05:57:43,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130224059] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:57:43,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142812911] [2025-03-17 05:57:43,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:43,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:43,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:43,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:57:43,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:57:43,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:43,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:43,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:43,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:43,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:57:43,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:57:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:57:43,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:57:43,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142812911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:43,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:57:43,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-17 05:57:43,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686367122] [2025-03-17 05:57:43,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:43,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:57:43,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:43,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:57:43,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:57:43,329 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:57:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:43,384 INFO L93 Difference]: Finished difference Result 236 states and 353 transitions. [2025-03-17 05:57:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:57:43,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-03-17 05:57:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:43,386 INFO L225 Difference]: With dead ends: 236 [2025-03-17 05:57:43,387 INFO L226 Difference]: Without dead ends: 120 [2025-03-17 05:57:43,387 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:57:43,388 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:43,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 493 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:57:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-17 05:57:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2025-03-17 05:57:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.4123711340206186) internal successors, (137), 97 states have internal predecessors, (137), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2025-03-17 05:57:43,402 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 163 [2025-03-17 05:57:43,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:43,403 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2025-03-17 05:57:43,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:57:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2025-03-17 05:57:43,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:57:43,408 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:43,408 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:43,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:57:43,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 05:57:43,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:43,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash -912685660, now seen corresponding path program 1 times [2025-03-17 05:57:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:43,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606270225] [2025-03-17 05:57:43,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:43,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:43,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:43,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:43,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:43,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:43,932 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:57:43,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606270225] [2025-03-17 05:57:43,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606270225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:57:43,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963422839] [2025-03-17 05:57:43,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:43,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:43,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:43,935 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:57:43,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:57:44,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:44,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:44,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:44,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:44,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:57:44,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:57:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:57:44,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:57:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963422839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:44,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:57:44,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-17 05:57:44,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486290435] [2025-03-17 05:57:44,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:44,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:57:44,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:44,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:57:44,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:57:44,189 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:57:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:44,227 INFO L93 Difference]: Finished difference Result 240 states and 357 transitions. [2025-03-17 05:57:44,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:57:44,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-03-17 05:57:44,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:44,231 INFO L225 Difference]: With dead ends: 240 [2025-03-17 05:57:44,232 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 05:57:44,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:57:44,233 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:44,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 494 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:57:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 05:57:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2025-03-17 05:57:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 179 transitions. [2025-03-17 05:57:44,242 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 179 transitions. Word has length 163 [2025-03-17 05:57:44,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:44,243 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 179 transitions. [2025-03-17 05:57:44,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:57:44,244 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 179 transitions. [2025-03-17 05:57:44,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:57:44,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:44,246 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:44,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 05:57:44,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:44,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:44,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:44,448 INFO L85 PathProgramCache]: Analyzing trace with hash -25181979, now seen corresponding path program 1 times [2025-03-17 05:57:44,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317173228] [2025-03-17 05:57:44,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:44,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:44,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:44,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:44,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:44,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:44,711 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:57:44,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317173228] [2025-03-17 05:57:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317173228] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:57:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028950272] [2025-03-17 05:57:44,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:44,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:44,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:44,714 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:57:44,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:57:44,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:44,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:44,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:44,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:44,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:57:44,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:57:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:57:44,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:57:44,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028950272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:44,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:57:44,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-03-17 05:57:44,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65240959] [2025-03-17 05:57:44,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:44,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:57:44,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:44,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:57:44,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:57:44,951 INFO L87 Difference]: Start difference. First operand 121 states and 179 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:57:44,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:44,976 INFO L93 Difference]: Finished difference Result 244 states and 361 transitions. [2025-03-17 05:57:44,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:57:44,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-03-17 05:57:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:44,978 INFO L225 Difference]: With dead ends: 244 [2025-03-17 05:57:44,978 INFO L226 Difference]: Without dead ends: 124 [2025-03-17 05:57:44,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:57:44,979 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:44,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 496 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:57:44,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-17 05:57:44,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2025-03-17 05:57:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.396039603960396) internal successors, (141), 101 states have internal predecessors, (141), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2025-03-17 05:57:44,985 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 163 [2025-03-17 05:57:44,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:44,985 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2025-03-17 05:57:44,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:57:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2025-03-17 05:57:44,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:57:44,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:44,987 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:44,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 05:57:45,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:45,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:45,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:45,188 INFO L85 PathProgramCache]: Analyzing trace with hash -24258458, now seen corresponding path program 1 times [2025-03-17 05:57:45,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:45,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687514181] [2025-03-17 05:57:45,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:45,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:45,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:45,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:45,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:45,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:45,931 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:57:45,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:45,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687514181] [2025-03-17 05:57:45,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687514181] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:57:45,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119098630] [2025-03-17 05:57:45,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:45,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:45,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:45,939 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:57:45,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 05:57:46,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:46,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:46,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:46,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:46,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:57:46,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:57:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:57:46,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:57:46,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119098630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:46,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:57:46,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:57:46,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141257814] [2025-03-17 05:57:46,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:46,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:57:46,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:46,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:57:46,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:57:46,255 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:57:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:46,314 INFO L93 Difference]: Finished difference Result 248 states and 365 transitions. [2025-03-17 05:57:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:57:46,315 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 163 [2025-03-17 05:57:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:46,316 INFO L225 Difference]: With dead ends: 248 [2025-03-17 05:57:46,317 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 05:57:46,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:57:46,318 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:46,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 657 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:57:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 05:57:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-17 05:57:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2025-03-17 05:57:46,324 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 163 [2025-03-17 05:57:46,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:46,325 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2025-03-17 05:57:46,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:57:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2025-03-17 05:57:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-17 05:57:46,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:46,326 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:46,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:57:46,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:46,527 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:46,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:46,529 INFO L85 PathProgramCache]: Analyzing trace with hash 486275719, now seen corresponding path program 1 times [2025-03-17 05:57:46,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:46,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736224981] [2025-03-17 05:57:46,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:46,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:46,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:46,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:46,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:57:47,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:47,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736224981] [2025-03-17 05:57:47,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736224981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:57:47,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144076781] [2025-03-17 05:57:47,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:47,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:47,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:47,912 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:57:47,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 05:57:48,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-17 05:57:48,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-17 05:57:48,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:48,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:48,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:57:48,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:57:48,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:48,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:48,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:48,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:48,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:48,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:48,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:48,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:57:48,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 31 [2025-03-17 05:57:48,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:57:48,397 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 34 treesize of output 10 [2025-03-17 05:57:48,407 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-03-17 05:57:48,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:57:48,648 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:57:48,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144076781] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:57:48,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:57:48,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 16 [2025-03-17 05:57:48,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899539930] [2025-03-17 05:57:48,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:57:48,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 05:57:48,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:48,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 05:57:48,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:57:48,650 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 16 states, 13 states have (on average 9.0) internal successors, (117), 16 states have internal predecessors, (117), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) [2025-03-17 05:57:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:49,331 INFO L93 Difference]: Finished difference Result 261 states and 375 transitions. [2025-03-17 05:57:49,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:57:49,333 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 9.0) internal successors, (117), 16 states have internal predecessors, (117), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) Word has length 163 [2025-03-17 05:57:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:49,334 INFO L225 Difference]: With dead ends: 261 [2025-03-17 05:57:49,334 INFO L226 Difference]: Without dead ends: 136 [2025-03-17 05:57:49,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:57:49,336 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 514 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:49,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 353 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:57:49,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-03-17 05:57:49,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2025-03-17 05:57:49,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.3545454545454545) internal successors, (149), 110 states have internal predecessors, (149), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 189 transitions. [2025-03-17 05:57:49,354 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 189 transitions. Word has length 163 [2025-03-17 05:57:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:49,354 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 189 transitions. [2025-03-17 05:57:49,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 9.0) internal successors, (117), 16 states have internal predecessors, (117), 7 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 4 states have call predecessors, (52), 7 states have call successors, (52) [2025-03-17 05:57:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 189 transitions. [2025-03-17 05:57:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:57:49,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:49,356 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:49,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 05:57:49,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:49,562 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:49,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash -301728650, now seen corresponding path program 1 times [2025-03-17 05:57:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:49,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447441679] [2025-03-17 05:57:49,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:49,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:57:49,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:57:49,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:49,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:57:50,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:50,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447441679] [2025-03-17 05:57:50,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447441679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:57:50,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69859095] [2025-03-17 05:57:50,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:50,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:50,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:50,643 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:57:50,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 05:57:50,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:57:50,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:57:50,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:50,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:50,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:57:50,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:57:50,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:50,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:50,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:50,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:51,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:51,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:51,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 05:57:51,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:57:51,073 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 40 treesize of output 31 [2025-03-17 05:57:51,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:57:51,102 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 34 treesize of output 10 [2025-03-17 05:57:51,131 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 267 proven. 45 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-03-17 05:57:51,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:57:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 45 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:57:51,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69859095] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 05:57:51,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 05:57:51,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21 [2025-03-17 05:57:51,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704960596] [2025-03-17 05:57:51,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 05:57:51,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:57:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:51,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:57:51,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:57:51,360 INFO L87 Difference]: Start difference. First operand 134 states and 189 transitions. Second operand has 21 states, 18 states have (on average 6.055555555555555) internal successors, (109), 21 states have internal predecessors, (109), 6 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 3 states have call predecessors, (52), 6 states have call successors, (52) [2025-03-17 05:57:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:52,140 INFO L93 Difference]: Finished difference Result 271 states and 382 transitions. [2025-03-17 05:57:52,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 05:57:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.055555555555555) internal successors, (109), 21 states have internal predecessors, (109), 6 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 3 states have call predecessors, (52), 6 states have call successors, (52) Word has length 164 [2025-03-17 05:57:52,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:52,142 INFO L225 Difference]: With dead ends: 271 [2025-03-17 05:57:52,142 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 05:57:52,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2025-03-17 05:57:52,143 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 212 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:52,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 750 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:57:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 05:57:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2025-03-17 05:57:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 191 transitions. [2025-03-17 05:57:52,154 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 191 transitions. Word has length 164 [2025-03-17 05:57:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:52,154 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 191 transitions. [2025-03-17 05:57:52,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.055555555555555) internal successors, (109), 21 states have internal predecessors, (109), 6 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (52), 3 states have call predecessors, (52), 6 states have call successors, (52) [2025-03-17 05:57:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 191 transitions. [2025-03-17 05:57:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:57:52,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:52,162 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:52,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 05:57:52,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:52,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:52,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash -368735403, now seen corresponding path program 1 times [2025-03-17 05:57:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:52,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424306535] [2025-03-17 05:57:52,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:52,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:57:52,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:57:52,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:52,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:52,971 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:57:52,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:52,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424306535] [2025-03-17 05:57:52,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424306535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:52,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:52,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:57:52,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685855753] [2025-03-17 05:57:52,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:52,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:57:52,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:52,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:57:52,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:57:52,973 INFO L87 Difference]: Start difference. First operand 136 states and 191 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:57:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:53,595 INFO L93 Difference]: Finished difference Result 279 states and 388 transitions. [2025-03-17 05:57:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:57:53,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2025-03-17 05:57:53,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:53,598 INFO L225 Difference]: With dead ends: 279 [2025-03-17 05:57:53,598 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 05:57:53,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:57:53,599 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 224 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:53,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 362 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:57:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 05:57:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2025-03-17 05:57:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 115 states have internal predecessors, (153), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:53,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 193 transitions. [2025-03-17 05:57:53,612 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 193 transitions. Word has length 164 [2025-03-17 05:57:53,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:53,612 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 193 transitions. [2025-03-17 05:57:53,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:57:53,612 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 193 transitions. [2025-03-17 05:57:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:57:53,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:53,613 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:53,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:57:53,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:53,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash -777559628, now seen corresponding path program 1 times [2025-03-17 05:57:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:53,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011729739] [2025-03-17 05:57:53,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:53,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:53,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:57:53,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:57:53,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:53,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:54,042 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:57:54,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:54,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011729739] [2025-03-17 05:57:54,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011729739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:54,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:54,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:57:54,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676235119] [2025-03-17 05:57:54,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:54,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:57:54,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:54,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:57:54,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:57:54,044 INFO L87 Difference]: Start difference. First operand 140 states and 193 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:57:54,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:54,405 INFO L93 Difference]: Finished difference Result 399 states and 549 transitions. [2025-03-17 05:57:54,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:57:54,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2025-03-17 05:57:54,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:54,408 INFO L225 Difference]: With dead ends: 399 [2025-03-17 05:57:54,408 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 05:57:54,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:57:54,409 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 130 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:54,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 501 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:57:54,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 05:57:54,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 144. [2025-03-17 05:57:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 119 states have (on average 1.3361344537815125) internal successors, (159), 119 states have internal predecessors, (159), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 199 transitions. [2025-03-17 05:57:54,438 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 199 transitions. Word has length 164 [2025-03-17 05:57:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:54,438 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 199 transitions. [2025-03-17 05:57:54,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:57:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 199 transitions. [2025-03-17 05:57:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:57:54,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:54,439 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:57:54,441 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:54,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 33815096, now seen corresponding path program 1 times [2025-03-17 05:57:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:54,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924511233] [2025-03-17 05:57:54,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:54,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:57:54,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:57:54,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:54,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:57:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:57:54,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:57:54,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924511233] [2025-03-17 05:57:54,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924511233] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:57:54,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:57:54,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:57:54,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689239727] [2025-03-17 05:57:54,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:57:54,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:57:54,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:57:54,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:57:54,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:57:54,826 INFO L87 Difference]: Start difference. First operand 144 states and 199 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:57:55,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:57:55,183 INFO L93 Difference]: Finished difference Result 403 states and 554 transitions. [2025-03-17 05:57:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:57:55,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2025-03-17 05:57:55,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:57:55,185 INFO L225 Difference]: With dead ends: 403 [2025-03-17 05:57:55,185 INFO L226 Difference]: Without dead ends: 260 [2025-03-17 05:57:55,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:57:55,186 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 219 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:57:55,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 403 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:57:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-17 05:57:55,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 145. [2025-03-17 05:57:55,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 120 states have internal predecessors, (160), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:57:55,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2025-03-17 05:57:55,201 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 164 [2025-03-17 05:57:55,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:57:55,202 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2025-03-17 05:57:55,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:57:55,202 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2025-03-17 05:57:55,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:57:55,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:57:55,205 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:55,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:57:55,205 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:57:55,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:57:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash -476719081, now seen corresponding path program 1 times [2025-03-17 05:57:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:57:55,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026851906] [2025-03-17 05:57:55,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:57:55,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:57:55,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:57:55,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:55,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:57:55,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [393757502] [2025-03-17 05:57:55,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:57:55,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:57:55,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:57:55,280 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:57:55,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 05:57:55,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:57:56,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:57:56,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:56,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:57:56,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:57:56,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:57:57,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:57:57,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:57:57,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:57:57,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:57:57,600 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:57:57,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:57:57,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 05:57:57,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-17 05:57:57,813 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:57:57,895 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:57:57,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:57:57 BoogieIcfgContainer [2025-03-17 05:57:57,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:57:57,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:57:57,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:57:57,901 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:57:57,901 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:57:41" (3/4) ... [2025-03-17 05:57:57,903 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:57:57,903 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:57:57,904 INFO L158 Benchmark]: Toolchain (without parser) took 17548.38ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 103.2MB in the beginning and 379.7MB in the end (delta: -276.4MB). Peak memory consumption was 99.9MB. Max. memory is 16.1GB. [2025-03-17 05:57:57,904 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:57:57,905 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.49ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 85.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:57:57,905 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.76ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 80.9MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:57:57,905 INFO L158 Benchmark]: Boogie Preprocessor took 45.36ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:57:57,905 INFO L158 Benchmark]: IcfgBuilder took 650.89ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 41.2MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 05:57:57,906 INFO L158 Benchmark]: TraceAbstraction took 16465.04ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 41.2MB in the beginning and 379.8MB in the end (delta: -338.6MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2025-03-17 05:57:57,906 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 520.1MB. Free memory was 379.8MB in the beginning and 379.7MB in the end (delta: 166.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:57:57,907 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.23ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.49ms. Allocated memory is still 142.6MB. Free memory was 103.2MB in the beginning and 85.9MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.76ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 80.9MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.36ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 650.89ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 41.2MB in the end (delta: 37.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16465.04ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 41.2MB in the beginning and 379.8MB in the end (delta: -338.6MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 520.1MB. Free memory was 379.8MB in the beginning and 379.7MB in the end (delta: 166.2kB). 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 102, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 81, overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 131, overapproximation of someBinaryArithmeticFLOAToperation at line 81. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 64, 4.5, 64.8, 64.4, 0.2, 10000, 1, 50, 8, 2, 100, 128, 23647, 32, 0, -50, 0, 0 }; [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] FCALL updateLastVariables() [L139] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_2 [L96] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_3 [L98] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L100] EXPR WrapperStruct00.var_1_4 [L100] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_4 [L100] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L100] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_5 [L102] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L102] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] WrapperStruct00.var_1_7 = __VERIFIER_nondet_short() [L104] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_8 = __VERIFIER_nondet_short() [L107] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 8192) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1] [L109] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L110] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L113] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L115] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L118] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L121] WrapperStruct00.var_1_19 = __VERIFIER_nondet_char() [L122] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L124] WrapperStruct00.var_1_21 = __VERIFIER_nondet_uchar() [L125] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L126] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L139] RET updateVariables() [L140] CALL step() [L66] EXPR WrapperStruct00.var_1_19 [L66] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_19 [L67] EXPR WrapperStruct00.var_1_21 [L67] WrapperStruct00.var_1_20 = WrapperStruct00.var_1_21 [L68] EXPR WrapperStruct00.var_1_18 [L68] signed char stepLocal_1 = WrapperStruct00.var_1_18; [L69] EXPR WrapperStruct00.var_1_9 [L69] EXPR WrapperStruct00.var_1_7 [L69] signed long int stepLocal_0 = WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7; [L70] EXPR WrapperStruct00.var_1_8 [L70] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_1=0] [L70] EXPR WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_1=0] [L70] COND FALSE !(stepLocal_1 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) [L77] EXPR WrapperStruct00.var_1_7 [L77] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L77] EXPR WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L77] signed long int stepLocal_2 = WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18; [L78] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0, stepLocal_2=10002] [L78] COND FALSE !(WrapperStruct00.var_1_14 >= stepLocal_2) [L81] EXPR WrapperStruct00.var_1_2 [L81] EXPR WrapperStruct00.var_1_3 [L81] EXPR WrapperStruct00.var_1_4 [L81] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L81] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L81] EXPR WrapperStruct00.var_1_4 [L81] EXPR WrapperStruct00.var_1_5 [L81] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L81] COND TRUE WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) [L82] WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=0] [L82] COND FALSE !(WrapperStruct00.var_1_20) [L92] EXPR WrapperStruct00.var_1_1 [L92] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_1 [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR WrapperStruct00.var_1_2 [L131] EXPR WrapperStruct00.var_1_3 [L131] EXPR WrapperStruct00.var_1_4 [L131] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L131] EXPR WrapperStruct00.var_1_3 [L131] EXPR ((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13))) [L131] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)) [L131] EXPR WrapperStruct00.var_1_1 [L131] EXPR WrapperStruct00.var_1_13 [L131] EXPR WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR (((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131] EXPR ((((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) VAL [WrapperStruct00={4:0}, isInitial=1] [L131-L132] return ((((((WrapperStruct00.var_1_2 != ((((WrapperStruct00.var_1_3) > ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? (WrapperStruct00.var_1_3) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))))) ? (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) (((WrapperStruct00.var_1_7 - 32) + (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_13)) - WrapperStruct00.var_1_13))) : 1) : (WrapperStruct00.var_1_20 ? (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_18)) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_13)))) && ((WrapperStruct00.var_1_18 > (WrapperStruct00.var_1_8 << WrapperStruct00.var_1_10)) ? (((WrapperStruct00.var_1_9 / WrapperStruct00.var_1_7) > -25) ? (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) : 1)) && ((WrapperStruct00.var_1_14 >= (WrapperStruct00.var_1_7 ^ WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_15 == ((unsigned short int) (WrapperStruct00.var_1_14 + (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_13)))) : 1)) && (WrapperStruct00.var_1_17 == ((unsigned short int) WrapperStruct00.var_1_1))) && (WrapperStruct00.var_1_18 == ((signed char) WrapperStruct00.var_1_19))) && (WrapperStruct00.var_1_20 == ((unsigned char) WrapperStruct00.var_1_21)) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 199 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 11, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1315 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1302 mSDsluCounter, 4680 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3353 mSDsCounter, 330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2919 IncrementalHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 330 mSolverCounterUnsat, 1327 mSDtfsCounter, 2919 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1590 GetRequests, 1485 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=10, InterpolantAutomatonStates: 76, 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, 10 MinimizatonAttempts, 242 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 3104 NumberOfCodeBlocks, 3104 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3084 ConstructedInterpolants, 0 QuantifiedInterpolants, 6396 SizeOfPredicates, 9 NumberOfNonLiveVariables, 4348 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 19 InterpolantComputations, 8 PerfectInterpolantSequences, 14048/14440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 05:57:57,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.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 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:57:59,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:57:59,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:57:59,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:57:59,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:58:00,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:58:00,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:58:00,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:58:00,019 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:58:00,019 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:58:00,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:58:00,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:58:00,020 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:58:00,020 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:58:00,020 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:58:00,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:58:00,021 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:58:00,021 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:58:00,021 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:58:00,021 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:58:00,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:58:00,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:58:00,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:58:00,021 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:58:00,022 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:58:00,022 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:58:00,022 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:58:00,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:58:00,022 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:58:00,022 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:58:00,022 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:58:00,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:58:00,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:58:00,023 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:58:00,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:58:00,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:58:00,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:58:00,023 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:58:00,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:58:00,023 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:58:00,023 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:58:00,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:58:00,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:58:00,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:58:00,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:58:00,024 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 -> 3866fcabc53f8729ce5445d739af818fee4df02a7fd7be02b76364ea8cb9d346 [2025-03-17 05:58:00,258 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:58:00,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:58:00,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:58:00,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:58:00,267 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:58:00,269 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-43.i [2025-03-17 05:58:01,484 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66846badc/62651c42b86841f4a0b7e5f30ebaa7ee/FLAGd2db9e8de [2025-03-17 05:58:01,673 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:58:01,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-43.i [2025-03-17 05:58:01,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66846badc/62651c42b86841f4a0b7e5f30ebaa7ee/FLAGd2db9e8de [2025-03-17 05:58:02,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66846badc/62651c42b86841f4a0b7e5f30ebaa7ee [2025-03-17 05:58:02,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:58:02,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:58:02,043 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:58:02,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:58:02,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:58:02,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52488cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02, skipping insertion in model container [2025-03-17 05:58:02,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:58:02,160 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-43.i[916,929] [2025-03-17 05:58:02,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:58:02,236 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:58:02,244 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-43.i[916,929] [2025-03-17 05:58:02,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:58:02,320 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:58:02,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02 WrapperNode [2025-03-17 05:58:02,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:58:02,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:58:02,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:58:02,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:58:02,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,375 INFO L138 Inliner]: procedures = 34, calls = 176, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2025-03-17 05:58:02,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:58:02,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:58:02,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:58:02,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:58:02,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,391 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,410 INFO L175 MemorySlicer]: Split 145 memory accesses to 2 slices as follows [2, 143]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 40 writes are split as follows [0, 40]. [2025-03-17 05:58:02,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:58:02,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:58:02,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:58:02,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:58:02,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (1/1) ... [2025-03-17 05:58:02,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:58:02,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:58:02,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:58:02,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:58:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:58:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:58:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:58:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:58:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:58:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:58:02,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:58:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:58:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:58:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:58:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:58:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 05:58:02,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 05:58:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 05:58:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 05:58:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:58:02,490 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:58:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 05:58:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 05:58:02,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:58:02,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:58:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:58:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:58:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:58:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:58:02,615 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:58:02,625 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:58:03,973 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~mem99#1;havoc property_#t~mem94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~ite113#1;havoc property_#t~mem100#1;havoc property_#t~ite106#1;havoc property_#t~mem105#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite124#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short125#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite133#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short140#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~short143#1; [2025-03-17 05:58:04,008 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-17 05:58:04,008 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:58:04,016 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:58:04,016 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:58:04,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:58:04 BoogieIcfgContainer [2025-03-17 05:58:04,016 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:58:04,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:58:04,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:58:04,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:58:04,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:58:02" (1/3) ... [2025-03-17 05:58:04,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4c4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:58:04, skipping insertion in model container [2025-03-17 05:58:04,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:58:02" (2/3) ... [2025-03-17 05:58:04,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4c4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:58:04, skipping insertion in model container [2025-03-17 05:58:04,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:58:04" (3/3) ... [2025-03-17 05:58:04,028 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-43.i [2025-03-17 05:58:04,038 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:58:04,039 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-43.i that has 2 procedures, 106 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:58:04,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:58:04,091 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;@443ed321, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:58:04,091 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:58:04,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 84 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:58:04,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:58:04,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:04,105 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:04,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:04,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1476087836, now seen corresponding path program 1 times [2025-03-17 05:58:04,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:04,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513521656] [2025-03-17 05:58:04,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:04,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:04,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:04,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:04,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:58:04,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:58:04,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:58:04,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:04,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:04,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:58:04,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2025-03-17 05:58:04,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:04,591 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:04,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513521656] [2025-03-17 05:58:04,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513521656] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:04,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:04,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:58:04,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389175396] [2025-03-17 05:58:04,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:04,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:58:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:04,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:58:04,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:58:04,619 INFO L87 Difference]: Start difference. First operand has 106 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 84 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:04,641 INFO L93 Difference]: Finished difference Result 209 states and 334 transitions. [2025-03-17 05:58:04,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:58:04,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-03-17 05:58:04,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:04,648 INFO L225 Difference]: With dead ends: 209 [2025-03-17 05:58:04,648 INFO L226 Difference]: Without dead ends: 104 [2025-03-17 05:58:04,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:58:04,654 INFO L435 NwaCegarLoop]: 154 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, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:04,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:58:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-17 05:58:04,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-17 05:58:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:58:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2025-03-17 05:58:04,690 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 160 [2025-03-17 05:58:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:04,690 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2025-03-17 05:58:04,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2025-03-17 05:58:04,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:58:04,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:04,698 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:04,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:58:04,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:04,898 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:04,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash 166572436, now seen corresponding path program 1 times [2025-03-17 05:58:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:04,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136689716] [2025-03-17 05:58:04,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:04,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:04,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:04,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:04,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:58:05,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:58:05,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:58:05,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:05,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:05,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:58:05,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:58:05,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:05,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:05,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1136689716] [2025-03-17 05:58:05,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1136689716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:05,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:05,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:58:05,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145660296] [2025-03-17 05:58:05,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:05,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:58:05,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:05,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:58:05,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:58:05,369 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:58:05,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:05,429 INFO L93 Difference]: Finished difference Result 212 states and 314 transitions. [2025-03-17 05:58:05,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:58:05,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:58:05,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:05,431 INFO L225 Difference]: With dead ends: 212 [2025-03-17 05:58:05,431 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 05:58:05,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:58:05,433 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:05,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 580 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:58:05,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 05:58:05,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-17 05:58:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:58:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 158 transitions. [2025-03-17 05:58:05,441 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 158 transitions. Word has length 160 [2025-03-17 05:58:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:05,442 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 158 transitions. [2025-03-17 05:58:05,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:58:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 158 transitions. [2025-03-17 05:58:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:58:05,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:05,444 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:05,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 05:58:05,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:05,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:05,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:05,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1640882027, now seen corresponding path program 1 times [2025-03-17 05:58:05,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:05,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672636524] [2025-03-17 05:58:05,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:05,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:05,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:05,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:05,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 05:58:05,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:58:06,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:58:06,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:06,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:06,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:58:06,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:58:06,121 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:06,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:06,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672636524] [2025-03-17 05:58:06,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672636524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:06,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:06,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:58:06,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256772792] [2025-03-17 05:58:06,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:06,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:58:06,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:06,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:58:06,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:58:06,123 INFO L87 Difference]: Start difference. First operand 108 states and 158 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:58:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:06,200 INFO L93 Difference]: Finished difference Result 218 states and 319 transitions. [2025-03-17 05:58:06,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:58:06,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:58:06,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:06,202 INFO L225 Difference]: With dead ends: 218 [2025-03-17 05:58:06,203 INFO L226 Difference]: Without dead ends: 111 [2025-03-17 05:58:06,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:58:06,204 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:06,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 715 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:58:06,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-17 05:58:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-17 05:58:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 88 states have internal predecessors, (120), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:58:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 160 transitions. [2025-03-17 05:58:06,211 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 160 transitions. Word has length 160 [2025-03-17 05:58:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:06,212 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 160 transitions. [2025-03-17 05:58:06,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:58:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 160 transitions. [2025-03-17 05:58:06,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:58:06,214 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:06,214 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:06,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-17 05:58:06,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:06,415 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:06,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:06,415 INFO L85 PathProgramCache]: Analyzing trace with hash -753378346, now seen corresponding path program 1 times [2025-03-17 05:58:06,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:06,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560868675] [2025-03-17 05:58:06,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:06,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:06,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:06,418 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:06,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 05:58:06,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:58:06,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:58:06,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:06,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:06,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 05:58:06,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:58:06,851 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:06,851 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:06,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560868675] [2025-03-17 05:58:06,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560868675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:06,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:06,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:58:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185586918] [2025-03-17 05:58:06,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:06,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:58:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:06,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:58:06,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:58:06,853 INFO L87 Difference]: Start difference. First operand 110 states and 160 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:58:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:06,926 INFO L93 Difference]: Finished difference Result 222 states and 323 transitions. [2025-03-17 05:58:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:58:06,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 160 [2025-03-17 05:58:06,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:06,928 INFO L225 Difference]: With dead ends: 222 [2025-03-17 05:58:06,928 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 05:58:06,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:58:06,929 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 1 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:06,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 851 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:58:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 05:58:06,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-17 05:58:06,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 90 states have internal predecessors, (122), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:58:06,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2025-03-17 05:58:06,935 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 160 [2025-03-17 05:58:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:06,936 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2025-03-17 05:58:06,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:58:06,936 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2025-03-17 05:58:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-17 05:58:06,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:06,937 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:06,950 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-17 05:58:07,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:07,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:07,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash -752454825, now seen corresponding path program 1 times [2025-03-17 05:58:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:07,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981528986] [2025-03-17 05:58:07,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:07,139 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:07,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:07,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:07,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 05:58:07,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 05:58:07,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 05:58:07,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:07,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:07,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:58:07,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:07,732 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-17 05:58:07,767 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2025-03-17 05:58:07,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:07,767 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:07,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981528986] [2025-03-17 05:58:07,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981528986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:07,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:07,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:58:07,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344407130] [2025-03-17 05:58:07,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:07,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:58:07,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:07,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:58:07,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:58:07,785 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:09,050 INFO L93 Difference]: Finished difference Result 224 states and 324 transitions. [2025-03-17 05:58:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:58:09,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 160 [2025-03-17 05:58:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:09,051 INFO L225 Difference]: With dead ends: 224 [2025-03-17 05:58:09,051 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 05:58:09,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 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-17 05:58:09,052 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 136 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:09,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 441 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 05:58:09,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 05:58:09,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-17 05:58:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:58:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 161 transitions. [2025-03-17 05:58:09,065 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 161 transitions. Word has length 160 [2025-03-17 05:58:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:09,066 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 161 transitions. [2025-03-17 05:58:09,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:09,066 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 161 transitions. [2025-03-17 05:58:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-03-17 05:58:09,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:09,071 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:09,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 05:58:09,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:09,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:09,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:09,273 INFO L85 PathProgramCache]: Analyzing trace with hash -42541159, now seen corresponding path program 1 times [2025-03-17 05:58:09,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:09,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703341474] [2025-03-17 05:58:09,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:09,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:09,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:09,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:09,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 05:58:09,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-03-17 05:58:09,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-03-17 05:58:09,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:09,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:09,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:58:09,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:09,710 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-17 05:58:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2025-03-17 05:58:09,731 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:09,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:09,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703341474] [2025-03-17 05:58:09,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703341474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:09,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:09,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:58:09,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525901364] [2025-03-17 05:58:09,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:09,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:58:09,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:09,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:58:09,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:58:09,734 INFO L87 Difference]: Start difference. First operand 112 states and 161 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:10,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:10,832 INFO L93 Difference]: Finished difference Result 224 states and 322 transitions. [2025-03-17 05:58:10,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:58:10,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2025-03-17 05:58:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:10,834 INFO L225 Difference]: With dead ends: 224 [2025-03-17 05:58:10,834 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 05:58:10,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:58:10,835 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 128 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:10,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 437 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 05:58:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 05:58:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-17 05:58:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-17 05:58:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-03-17 05:58:10,841 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 162 [2025-03-17 05:58:10,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:10,842 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-03-17 05:58:10,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:10,842 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-03-17 05:58:10,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:58:10,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:10,843 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:10,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-17 05:58:11,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:11,044 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:11,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:11,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1380985559, now seen corresponding path program 1 times [2025-03-17 05:58:11,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:11,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134013031] [2025-03-17 05:58:11,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:11,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:11,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:11,046 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:11,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 05:58:11,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:58:11,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:58:11,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:11,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:11,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:58:11,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:11,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:11,617 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 46 treesize of output 46 [2025-03-17 05:58:11,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:11,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 100 [2025-03-17 05:58:11,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:11,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 35 [2025-03-17 05:58:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:58:11,879 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:11,879 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:11,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134013031] [2025-03-17 05:58:11,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134013031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:11,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:11,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:58:11,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616251355] [2025-03-17 05:58:11,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:11,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:58:11,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:11,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:58:11,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:58:11,880 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:17,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:17,081 INFO L93 Difference]: Finished difference Result 381 states and 538 transitions. [2025-03-17 05:58:17,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:58:17,082 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2025-03-17 05:58:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:17,085 INFO L225 Difference]: With dead ends: 381 [2025-03-17 05:58:17,085 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 05:58:17,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:58:17,086 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 337 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:17,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 480 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-17 05:58:17,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 05:58:17,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2025-03-17 05:58:17,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 207 states have (on average 1.3140096618357489) internal successors, (272), 209 states have internal predecessors, (272), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:58:17,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 368 transitions. [2025-03-17 05:58:17,140 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 368 transitions. Word has length 164 [2025-03-17 05:58:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:17,140 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 368 transitions. [2025-03-17 05:58:17,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 368 transitions. [2025-03-17 05:58:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:58:17,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:17,141 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:17,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 05:58:17,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:17,342 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:17,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:17,343 INFO L85 PathProgramCache]: Analyzing trace with hash 972161334, now seen corresponding path program 1 times [2025-03-17 05:58:17,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:17,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819968930] [2025-03-17 05:58:17,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:17,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:17,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:17,346 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:17,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 05:58:17,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:58:17,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:58:17,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:17,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:17,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:58:17,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:18,064 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:18,064 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 46 treesize of output 46 [2025-03-17 05:58:18,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:18,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 100 [2025-03-17 05:58:18,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:18,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 103 [2025-03-17 05:58:18,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:18,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 35 [2025-03-17 05:58:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:58:18,409 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:18,409 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:18,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819968930] [2025-03-17 05:58:18,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819968930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:18,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:18,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:58:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175828936] [2025-03-17 05:58:18,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:18,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:58:18,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:18,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:58:18,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:58:18,410 INFO L87 Difference]: Start difference. First operand 260 states and 368 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:23,323 INFO L93 Difference]: Finished difference Result 477 states and 666 transitions. [2025-03-17 05:58:23,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:58:23,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2025-03-17 05:58:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:23,325 INFO L225 Difference]: With dead ends: 477 [2025-03-17 05:58:23,325 INFO L226 Difference]: Without dead ends: 270 [2025-03-17 05:58:23,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:58:23,326 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 328 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:23,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 478 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 05:58:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-17 05:58:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 260. [2025-03-17 05:58:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 207 states have (on average 1.3043478260869565) internal successors, (270), 209 states have internal predecessors, (270), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:58:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 366 transitions. [2025-03-17 05:58:23,350 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 366 transitions. Word has length 164 [2025-03-17 05:58:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:23,351 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 366 transitions. [2025-03-17 05:58:23,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 366 transitions. [2025-03-17 05:58:23,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:58:23,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:23,352 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:23,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 05:58:23,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:23,553 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:23,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash 461627157, now seen corresponding path program 1 times [2025-03-17 05:58:23,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:23,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214873899] [2025-03-17 05:58:23,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:23,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:23,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:23,556 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:23,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 05:58:23,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:58:23,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:58:23,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:23,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:23,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:58:23,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:23,911 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-17 05:58:23,912 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:23,912 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:23,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214873899] [2025-03-17 05:58:23,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214873899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:23,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:23,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:58:23,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891613109] [2025-03-17 05:58:23,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:23,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:58:23,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:23,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:58:23,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:58:23,914 INFO L87 Difference]: Start difference. First operand 260 states and 366 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:58:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:23,957 INFO L93 Difference]: Finished difference Result 471 states and 659 transitions. [2025-03-17 05:58:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:58:23,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 164 [2025-03-17 05:58:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:23,963 INFO L225 Difference]: With dead ends: 471 [2025-03-17 05:58:23,963 INFO L226 Difference]: Without dead ends: 264 [2025-03-17 05:58:23,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:58:23,964 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:23,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 574 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:58:23,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-17 05:58:23,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-03-17 05:58:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 213 states have internal predecessors, (274), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:58:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 370 transitions. [2025-03-17 05:58:23,987 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 370 transitions. Word has length 164 [2025-03-17 05:58:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:23,988 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 370 transitions. [2025-03-17 05:58:23,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-17 05:58:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 370 transitions. [2025-03-17 05:58:23,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:58:23,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:23,990 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:24,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-17 05:58:24,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:24,191 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:24,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1783536058, now seen corresponding path program 1 times [2025-03-17 05:58:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:24,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764390483] [2025-03-17 05:58:24,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:24,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:24,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:24,193 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:24,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 05:58:24,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:58:24,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:58:24,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:24,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:24,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:58:24,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:24,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:24,757 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 46 treesize of output 46 [2025-03-17 05:58:24,827 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:24,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 89 treesize of output 100 [2025-03-17 05:58:25,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:25,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 103 [2025-03-17 05:58:25,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:25,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 95 treesize of output 35 [2025-03-17 05:58:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-17 05:58:25,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:25,083 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:25,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764390483] [2025-03-17 05:58:25,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764390483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:25,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:25,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:58:25,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879153648] [2025-03-17 05:58:25,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:25,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:58:25,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:25,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:58:25,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:58:25,084 INFO L87 Difference]: Start difference. First operand 264 states and 370 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:58:31,404 INFO L93 Difference]: Finished difference Result 485 states and 670 transitions. [2025-03-17 05:58:31,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 05:58:31,406 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 164 [2025-03-17 05:58:31,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:58:31,408 INFO L225 Difference]: With dead ends: 485 [2025-03-17 05:58:31,408 INFO L226 Difference]: Without dead ends: 274 [2025-03-17 05:58:31,408 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:58:31,409 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 249 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:58:31,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 505 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-03-17 05:58:31,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-17 05:58:31,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2025-03-17 05:58:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 211 states have (on average 1.2890995260663507) internal successors, (272), 213 states have internal predecessors, (272), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-17 05:58:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 368 transitions. [2025-03-17 05:58:31,428 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 368 transitions. Word has length 164 [2025-03-17 05:58:31,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:58:31,428 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 368 transitions. [2025-03-17 05:58:31,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 2 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-17 05:58:31,429 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 368 transitions. [2025-03-17 05:58:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-17 05:58:31,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:58:31,430 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:58:31,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 05:58:31,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:31,631 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:58:31,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:58:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1273001881, now seen corresponding path program 1 times [2025-03-17 05:58:31,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:58:31,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065957965] [2025-03-17 05:58:31,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:58:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:58:31,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:58:31,634 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:58:31,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-17 05:58:31,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 05:58:32,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 05:58:32,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:58:32,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:58:32,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 05:58:32,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:58:32,168 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-17 05:58:32,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2025-03-17 05:58:32,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:32,660 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 110 treesize of output 55 [2025-03-17 05:58:32,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:32,825 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 110 treesize of output 55 [2025-03-17 05:58:32,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:32,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 105 treesize of output 65 [2025-03-17 05:58:33,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:33,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 78 [2025-03-17 05:58:33,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:33,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 81 [2025-03-17 05:58:33,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:33,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 81 [2025-03-17 05:58:34,155 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:34,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 81 [2025-03-17 05:58:34,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:34,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 130 treesize of output 81 [2025-03-17 05:58:34,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:34,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 91 [2025-03-17 05:58:35,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:35,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 104 [2025-03-17 05:58:35,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:35,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 165 treesize of output 129 [2025-03-17 05:58:36,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:36,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 203 treesize of output 184 [2025-03-17 05:58:39,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 215 [2025-03-17 05:58:41,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:58:41,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 330 treesize of output 126 [2025-03-17 05:58:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 556 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-17 05:58:43,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:58:43,667 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:58:43,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065957965] [2025-03-17 05:58:43,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065957965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:58:43,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:58:43,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-03-17 05:58:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749139763] [2025-03-17 05:58:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:58:43,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 05:58:43,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:58:43,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 05:58:43,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:58:43,670 INFO L87 Difference]: Start difference. First operand 264 states and 368 transitions. Second operand has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 6 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2025-03-17 05:58:45,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 05:59:13,141 WARN L286 SmtUtils]: Spent 9.41s on a formula simplification. DAG size of input: 137 DAG size of output: 128 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)