./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.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 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:44:47,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:44:47,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:44:47,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:44:47,315 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:44:47,329 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:44:47,330 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:44:47,330 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:44:47,330 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:44:47,330 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:44:47,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:44:47,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:44:47,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:44:47,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:44:47,330 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:44:47,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:44:47,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:44:47,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:44:47,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:44:47,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:44:47,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:44:47,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:44:47,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:44:47,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:44:47,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:44:47,334 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:44:47,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:44:47,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:44:47,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:44:47,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:44:47,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:44:47,334 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 -> 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 [2025-03-04 01:44:47,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:44:47,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:44:47,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:44:47,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:44:47,592 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:44:47,593 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-86.i [2025-03-04 01:44:48,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d535427/6588e3e8fd5444dc8c75c00059d96c8b/FLAG8b0909c6a [2025-03-04 01:44:48,968 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:44:48,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i [2025-03-04 01:44:48,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d535427/6588e3e8fd5444dc8c75c00059d96c8b/FLAG8b0909c6a [2025-03-04 01:44:49,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3d535427/6588e3e8fd5444dc8c75c00059d96c8b [2025-03-04 01:44:49,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:44:49,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:44:49,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:44:49,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:44:49,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:44:49,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,300 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c7e792c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49, skipping insertion in model container [2025-03-04 01:44:49,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:44:49,412 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-86.i[916,929] [2025-03-04 01:44:49,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:44:49,494 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:44:49,502 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-86.i[916,929] [2025-03-04 01:44:49,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:44:49,573 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:44:49,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49 WrapperNode [2025-03-04 01:44:49,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:44:49,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:44:49,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:44:49,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:44:49,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,595 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,639 INFO L138 Inliner]: procedures = 30, calls = 243, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 761 [2025-03-04 01:44:49,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:44:49,642 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:44:49,642 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:44:49,642 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:44:49,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,661 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:44:49,662 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,662 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:44:49,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:44:49,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:44:49,701 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:44:49,701 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (1/1) ... [2025-03-04 01:44:49,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:44:49,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:49,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:44:49,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:44:49,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:44:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:44:49,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:44:49,861 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:44:49,862 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:44:50,422 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~mem139#1;havoc property_#t~ite152#1;havoc property_#t~mem149#1;havoc property_#t~mem142#1;havoc property_#t~mem140#1;havoc property_#t~mem141#1;havoc property_#t~mem143#1;havoc property_#t~ite148#1;havoc property_#t~mem146#1;havoc property_#t~mem144#1;havoc property_#t~mem145#1;havoc property_#t~mem147#1;havoc property_#t~mem151#1;havoc property_#t~mem150#1;havoc property_#t~mem153#1;havoc property_#t~ite158#1;havoc property_#t~mem157#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~mem156#1;havoc property_#t~short159#1;havoc property_#t~mem160#1;havoc property_#t~mem161#1;havoc property_#t~short162#1;havoc property_#t~ite226#1;havoc property_#t~mem177#1;havoc property_#t~mem176#1;havoc property_#t~mem163#1;havoc property_#t~mem164#1;havoc property_#t~ite167#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~mem168#1;havoc property_#t~ite175#1;havoc property_#t~mem169#1;havoc property_#t~mem170#1;havoc property_#t~ite173#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~mem174#1;havoc property_#t~mem180#1;havoc property_#t~mem178#1;havoc property_#t~bitwise179#1;havoc property_#t~ite225#1;havoc property_#t~mem221#1;havoc property_#t~mem181#1;havoc property_#t~mem182#1;havoc property_#t~mem183#1;havoc property_#t~ite186#1;havoc property_#t~mem184#1;havoc property_#t~mem185#1;havoc property_#t~ite193#1;havoc property_#t~mem187#1;havoc property_#t~mem188#1;havoc property_#t~mem189#1;havoc property_#t~ite192#1;havoc property_#t~mem190#1;havoc property_#t~mem191#1;havoc property_#t~ite220#1;havoc property_#t~mem194#1;havoc property_#t~mem195#1;havoc property_#t~mem196#1;havoc property_#t~ite199#1;havoc property_#t~mem197#1;havoc property_#t~mem198#1;havoc property_#t~ite206#1;havoc property_#t~mem200#1;havoc property_#t~mem201#1;havoc property_#t~mem202#1;havoc property_#t~ite205#1;havoc property_#t~mem203#1;havoc property_#t~mem204#1;havoc property_#t~mem207#1;havoc property_#t~mem208#1;havoc property_#t~mem209#1;havoc property_#t~ite212#1;havoc property_#t~mem210#1;havoc property_#t~mem211#1;havoc property_#t~ite219#1;havoc property_#t~mem213#1;havoc property_#t~mem214#1;havoc property_#t~mem215#1;havoc property_#t~ite218#1;havoc property_#t~mem216#1;havoc property_#t~mem217#1;havoc property_#t~mem224#1;havoc property_#t~mem222#1;havoc property_#t~mem223#1;havoc property_#t~short227#1;havoc property_#t~mem229#1;havoc property_#t~mem228#1;havoc property_#t~short230#1; [2025-03-04 01:44:50,453 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2025-03-04 01:44:50,453 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:44:50,475 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:44:50,476 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:44:50,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:50 BoogieIcfgContainer [2025-03-04 01:44:50,476 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:44:50,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:44:50,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:44:50,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:44:50,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:44:49" (1/3) ... [2025-03-04 01:44:50,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5672cfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:44:50, skipping insertion in model container [2025-03-04 01:44:50,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:44:49" (2/3) ... [2025-03-04 01:44:50,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5672cfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:44:50, skipping insertion in model container [2025-03-04 01:44:50,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:50" (3/3) ... [2025-03-04 01:44:50,484 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-86.i [2025-03-04 01:44:50,496 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:44:50,497 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-86.i that has 2 procedures, 158 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:44:50,556 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:44:50,567 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;@52348aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:44:50,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:44:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 130 states have (on average 1.4307692307692308) internal successors, (186), 131 states have internal predecessors, (186), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:44:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 01:44:50,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:50,585 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:44:50,585 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:50,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2109060434, now seen corresponding path program 1 times [2025-03-04 01:44:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:50,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453178140] [2025-03-04 01:44:50,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:50,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 01:44:50,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 01:44:50,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:50,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:50,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-04 01:44:50,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:50,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453178140] [2025-03-04 01:44:50,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453178140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:44:50,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014564063] [2025-03-04 01:44:50,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:50,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:44:50,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:44:50,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:44:50,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:44:51,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 01:44:51,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 01:44:51,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:51,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:51,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:44:51,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:44:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-04 01:44:51,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:44:51,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014564063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:51,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:44:51,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:44:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427812884] [2025-03-04 01:44:51,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:51,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:44:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:51,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:44:51,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:44:51,261 INFO L87 Difference]: Start difference. First operand has 158 states, 130 states have (on average 1.4307692307692308) internal successors, (186), 131 states have internal predecessors, (186), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:44:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:51,285 INFO L93 Difference]: Finished difference Result 310 states and 492 transitions. [2025-03-04 01:44:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:44:51,287 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2025-03-04 01:44:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:51,291 INFO L225 Difference]: With dead ends: 310 [2025-03-04 01:44:51,291 INFO L226 Difference]: Without dead ends: 155 [2025-03-04 01:44:51,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:44:51,295 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:51,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 229 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:51,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-04 01:44:51,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2025-03-04 01:44:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.4140625) internal successors, (181), 128 states have internal predecessors, (181), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:44:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 231 transitions. [2025-03-04 01:44:51,336 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 231 transitions. Word has length 185 [2025-03-04 01:44:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:51,336 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 231 transitions. [2025-03-04 01:44:51,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:44:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 231 transitions. [2025-03-04 01:44:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 01:44:51,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:51,341 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:44:51,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:44:51,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:44:51,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:51,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1733472715, now seen corresponding path program 1 times [2025-03-04 01:44:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:51,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42687409] [2025-03-04 01:44:51,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:51,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 01:44:51,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 01:44:51,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:51,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:51,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:44:51,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:51,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42687409] [2025-03-04 01:44:51,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42687409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:51,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:51,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:44:51,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998623466] [2025-03-04 01:44:51,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:51,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:44:51,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:51,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:44:51,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:51,885 INFO L87 Difference]: Start difference. First operand 155 states and 231 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:44:51,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:51,935 INFO L93 Difference]: Finished difference Result 309 states and 462 transitions. [2025-03-04 01:44:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:44:51,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 185 [2025-03-04 01:44:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:51,939 INFO L225 Difference]: With dead ends: 309 [2025-03-04 01:44:51,940 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 01:44:51,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:51,942 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:51,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 670 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 01:44:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-04 01:44:51,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.4076923076923078) internal successors, (183), 130 states have internal predecessors, (183), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:44:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 233 transitions. [2025-03-04 01:44:51,959 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 233 transitions. Word has length 185 [2025-03-04 01:44:51,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:51,960 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 233 transitions. [2025-03-04 01:44:51,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:44:51,960 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 233 transitions. [2025-03-04 01:44:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 01:44:51,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:51,965 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:44:51,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:44:51,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:51,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:51,966 INFO L85 PathProgramCache]: Analyzing trace with hash -909791244, now seen corresponding path program 1 times [2025-03-04 01:44:51,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:51,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707886870] [2025-03-04 01:44:51,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:51,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:52,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 01:44:52,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 01:44:52,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:52,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:52,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:44:52,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707886870] [2025-03-04 01:44:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707886870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:52,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:52,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:44:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618125878] [2025-03-04 01:44:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:52,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:44:52,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:52,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:44:52,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:52,237 INFO L87 Difference]: Start difference. First operand 157 states and 233 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:44:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:52,267 INFO L93 Difference]: Finished difference Result 314 states and 467 transitions. [2025-03-04 01:44:52,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:44:52,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2025-03-04 01:44:52,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:52,271 INFO L225 Difference]: With dead ends: 314 [2025-03-04 01:44:52,271 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 01:44:52,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:44:52,272 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:52,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 669 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:44:52,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 01:44:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2025-03-04 01:44:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.4015151515151516) internal successors, (185), 132 states have internal predecessors, (185), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:44:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 235 transitions. [2025-03-04 01:44:52,287 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 235 transitions. Word has length 185 [2025-03-04 01:44:52,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:52,289 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 235 transitions. [2025-03-04 01:44:52,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:44:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 235 transitions. [2025-03-04 01:44:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-04 01:44:52,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:52,291 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:44:52,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:44:52,292 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:52,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash -908867723, now seen corresponding path program 1 times [2025-03-04 01:44:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:52,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695846494] [2025-03-04 01:44:52,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:52,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-04 01:44:52,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-04 01:44:52,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:52,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:44:53,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:53,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695846494] [2025-03-04 01:44:53,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695846494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:53,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:53,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:44:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870620044] [2025-03-04 01:44:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:53,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:44:53,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:53,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:44:53,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:44:53,203 INFO L87 Difference]: Start difference. First operand 159 states and 235 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:44:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:53,661 INFO L93 Difference]: Finished difference Result 414 states and 613 transitions. [2025-03-04 01:44:53,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:44:53,661 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 185 [2025-03-04 01:44:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:53,663 INFO L225 Difference]: With dead ends: 414 [2025-03-04 01:44:53,663 INFO L226 Difference]: Without dead ends: 258 [2025-03-04 01:44:53,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:53,665 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 129 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:53,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 768 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:44:53,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2025-03-04 01:44:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 255. [2025-03-04 01:44:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 221 states have (on average 1.4298642533936652) internal successors, (316), 222 states have internal predecessors, (316), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:44:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 378 transitions. [2025-03-04 01:44:53,675 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 378 transitions. Word has length 185 [2025-03-04 01:44:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:53,676 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 378 transitions. [2025-03-04 01:44:53,676 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:44:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 378 transitions. [2025-03-04 01:44:53,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 01:44:53,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:53,678 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:44:53,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:44:53,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:53,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash 22605303, now seen corresponding path program 1 times [2025-03-04 01:44:53,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:53,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445017870] [2025-03-04 01:44:53,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:53,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:53,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 01:44:53,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 01:44:53,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:53,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:55,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:44:55,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:55,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445017870] [2025-03-04 01:44:55,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445017870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:55,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:55,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:44:55,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699366914] [2025-03-04 01:44:55,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:55,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:44:55,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:55,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:44:55,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:55,553 INFO L87 Difference]: Start difference. First operand 255 states and 378 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:44:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:56,042 INFO L93 Difference]: Finished difference Result 504 states and 747 transitions. [2025-03-04 01:44:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:44:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2025-03-04 01:44:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:56,046 INFO L225 Difference]: With dead ends: 504 [2025-03-04 01:44:56,048 INFO L226 Difference]: Without dead ends: 252 [2025-03-04 01:44:56,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:56,050 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 212 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:56,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 619 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:44:56,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-04 01:44:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2025-03-04 01:44:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 216 states have (on average 1.4166666666666667) internal successors, (306), 217 states have internal predecessors, (306), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:44:56,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 368 transitions. [2025-03-04 01:44:56,074 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 368 transitions. Word has length 187 [2025-03-04 01:44:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:56,074 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 368 transitions. [2025-03-04 01:44:56,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:44:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 368 transitions. [2025-03-04 01:44:56,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 01:44:56,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:56,076 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:44:56,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:44:56,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash -487928874, now seen corresponding path program 1 times [2025-03-04 01:44:56,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:56,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266009804] [2025-03-04 01:44:56,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:56,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:56,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 01:44:56,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 01:44:56,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:56,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:44:57,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:57,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266009804] [2025-03-04 01:44:57,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266009804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:57,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:57,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:44:57,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172031703] [2025-03-04 01:44:57,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:57,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:44:57,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:57,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:44:57,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:57,533 INFO L87 Difference]: Start difference. First operand 250 states and 368 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:44:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:44:58,025 INFO L93 Difference]: Finished difference Result 499 states and 734 transitions. [2025-03-04 01:44:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:44:58,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2025-03-04 01:44:58,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:44:58,027 INFO L225 Difference]: With dead ends: 499 [2025-03-04 01:44:58,027 INFO L226 Difference]: Without dead ends: 252 [2025-03-04 01:44:58,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:44:58,028 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 204 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:44:58,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 762 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:44:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-04 01:44:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2025-03-04 01:44:58,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 216 states have (on average 1.412037037037037) internal successors, (305), 217 states have internal predecessors, (305), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:44:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 367 transitions. [2025-03-04 01:44:58,046 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 367 transitions. Word has length 187 [2025-03-04 01:44:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:44:58,047 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 367 transitions. [2025-03-04 01:44:58,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:44:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 367 transitions. [2025-03-04 01:44:58,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 01:44:58,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:44:58,049 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:44:58,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:44:58,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:44:58,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:44:58,049 INFO L85 PathProgramCache]: Analyzing trace with hash -967421869, now seen corresponding path program 1 times [2025-03-04 01:44:58,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:44:58,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842062301] [2025-03-04 01:44:58,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:44:58,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:44:58,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 01:44:58,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 01:44:58,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:44:58,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:44:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:44:59,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:44:59,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842062301] [2025-03-04 01:44:59,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842062301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:44:59,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:44:59,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:44:59,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19799591] [2025-03-04 01:44:59,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:44:59,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:44:59,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:44:59,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:44:59,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:44:59,267 INFO L87 Difference]: Start difference. First operand 250 states and 367 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:45:00,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:00,009 INFO L93 Difference]: Finished difference Result 495 states and 726 transitions. [2025-03-04 01:45:00,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:45:00,010 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2025-03-04 01:45:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:00,012 INFO L225 Difference]: With dead ends: 495 [2025-03-04 01:45:00,012 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 01:45:00,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:45:00,013 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 105 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:00,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 626 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:45:00,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 01:45:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2025-03-04 01:45:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 212 states have (on average 1.4056603773584906) internal successors, (298), 213 states have internal predecessors, (298), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:45:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 360 transitions. [2025-03-04 01:45:00,028 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 360 transitions. Word has length 187 [2025-03-04 01:45:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:00,029 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 360 transitions. [2025-03-04 01:45:00,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:45:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 360 transitions. [2025-03-04 01:45:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 01:45:00,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:00,030 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:00,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:45:00,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:00,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash -997166253, now seen corresponding path program 1 times [2025-03-04 01:45:00,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:00,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809533992] [2025-03-04 01:45:00,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:00,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:00,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 01:45:00,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 01:45:00,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:00,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-04 01:45:00,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:45:00,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809533992] [2025-03-04 01:45:00,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809533992] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:45:00,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487738133] [2025-03-04 01:45:00,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:00,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:45:00,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:45:00,625 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:45:00,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:45:00,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 01:45:01,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 01:45:01,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:01,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:01,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:45:01,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:01,133 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 17 [2025-03-04 01:45:01,146 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 33 treesize of output 17 [2025-03-04 01:45:01,156 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 35 treesize of output 28 [2025-03-04 01:45:01,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:01,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2025-03-04 01:45:01,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 162 proven. 3 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-04 01:45:01,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:45:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-04 01:45:01,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487738133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:45:01,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 01:45:01,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-03-04 01:45:01,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760474090] [2025-03-04 01:45:01,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 01:45:01,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:45:01,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:45:01,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:45:01,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:45:01,464 INFO L87 Difference]: Start difference. First operand 246 states and 360 transitions. Second operand has 18 states, 15 states have (on average 8.4) internal successors, (126), 18 states have internal predecessors, (126), 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-04 01:45:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:03,616 INFO L93 Difference]: Finished difference Result 590 states and 852 transitions. [2025-03-04 01:45:03,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 01:45:03,617 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.4) internal successors, (126), 18 states have internal predecessors, (126), 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 187 [2025-03-04 01:45:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:03,619 INFO L225 Difference]: With dead ends: 590 [2025-03-04 01:45:03,619 INFO L226 Difference]: Without dead ends: 347 [2025-03-04 01:45:03,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 369 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=363, Invalid=1197, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 01:45:03,620 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 621 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 2377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:03,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 860 Invalid, 2377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 01:45:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-03-04 01:45:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 330. [2025-03-04 01:45:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 267 states have (on average 1.348314606741573) internal successors, (360), 269 states have internal predecessors, (360), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:45:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 472 transitions. [2025-03-04 01:45:03,643 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 472 transitions. Word has length 187 [2025-03-04 01:45:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:03,643 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 472 transitions. [2025-03-04 01:45:03,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.4) internal successors, (126), 18 states have internal predecessors, (126), 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-04 01:45:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 472 transitions. [2025-03-04 01:45:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 01:45:03,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:03,645 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:03,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:45:03,850 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,SelfDestructingSolverStorable7 [2025-03-04 01:45:03,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:03,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:03,850 INFO L85 PathProgramCache]: Analyzing trace with hash -627737001, now seen corresponding path program 1 times [2025-03-04 01:45:03,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:45:03,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908614736] [2025-03-04 01:45:03,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:03,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:45:03,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 01:45:03,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 01:45:03,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:03,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:45:03,930 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:45:03,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 01:45:03,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 01:45:03,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:03,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:45:04,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:45:04,042 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:45:04,043 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:45:04,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:45:04,048 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:04,110 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:45:04,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:45:04 BoogieIcfgContainer [2025-03-04 01:45:04,114 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:45:04,115 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:45:04,115 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:45:04,115 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:45:04,116 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:44:50" (3/4) ... [2025-03-04 01:45:04,117 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:45:04,118 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:45:04,119 INFO L158 Benchmark]: Toolchain (without parser) took 14823.96ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 105.7MB in the beginning and 522.5MB in the end (delta: -416.7MB). Peak memory consumption was 119.5MB. Max. memory is 16.1GB. [2025-03-04 01:45:04,119 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:45:04,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.67ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 84.2MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:45:04,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.65ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 77.9MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:45:04,120 INFO L158 Benchmark]: Boogie Preprocessor took 57.84ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 73.1MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:45:04,120 INFO L158 Benchmark]: IcfgBuilder took 775.81ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 90.8MB in the end (delta: -17.7MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2025-03-04 01:45:04,120 INFO L158 Benchmark]: TraceAbstraction took 13636.37ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 90.1MB in the beginning and 522.6MB in the end (delta: -432.5MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. [2025-03-04 01:45:04,121 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 679.5MB. Free memory was 522.6MB in the beginning and 522.5MB in the end (delta: 141.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:45:04,122 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.16ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.67ms. Allocated memory is still 142.6MB. Free memory was 104.8MB in the beginning and 84.2MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.65ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 77.9MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.84ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 73.1MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 775.81ms. Allocated memory is still 142.6MB. Free memory was 73.1MB in the beginning and 90.8MB in the end (delta: -17.7MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13636.37ms. Allocated memory was 142.6MB in the beginning and 679.5MB in the end (delta: 536.9MB). Free memory was 90.1MB in the beginning and 522.6MB in the end (delta: -432.5MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 679.5MB. Free memory was 522.6MB in the beginning and 522.5MB in the end (delta: 141.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryArithmeticFLOAToperation at line 73. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 2, 256, -256, 2, 255.8, 127.8, 128.5, 499.3, 10, 1, 8, 256, 1, 16, 57705, 64 }; VAL [WrapperStruct00={4:0}, isInitial=0] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L87] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L88] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_3 = __VERIFIER_nondet_short() [L91] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= -16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= -16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] WrapperStruct00.var_1_4 = __VERIFIER_nondet_short() [L94] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 8192) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 8192) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] WrapperStruct00.var_1_5 = __VERIFIER_nondet_short() [L97] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= -8191) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= -8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 8191) 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_5 <= 8191) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] WrapperStruct00.var_1_6 = __VERIFIER_nondet_short() [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -32767) 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_6 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1] [L102] WrapperStruct00.var_1_8 = __VERIFIER_nondet_float() [L103] EXPR WrapperStruct00.var_1_8 [L103] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_8 [L103] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L103] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 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] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_9 [L105] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_9 [L105] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L105] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 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] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L106] WrapperStruct00.var_1_10 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_10 [L107] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_10 [L107] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L107] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 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] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L108] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 1) 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_12 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L111] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ushort() [L112] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 32767) 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_13 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L114] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ushort() [L115] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L115] 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] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32767) 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 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L117] WrapperStruct00.var_1_15 = __VERIFIER_nondet_ushort() [L118] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32767) 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_15 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L120] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ushort() [L121] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L122] 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] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L123] WrapperStruct00.var_1_17 = __VERIFIER_nondet_ushort() [L124] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L125] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 65534) 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_17 <= 65534) VAL [WrapperStruct00={4:0}, isInitial=1] [L138] RET updateVariables() [L139] CALL step() [L66] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L66] COND FALSE !(! WrapperStruct00.var_1_2) [L69] EXPR WrapperStruct00.var_1_5 [L69] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_5 [L71] EXPR WrapperStruct00.var_1_5 [L71] signed short int stepLocal_0 = WrapperStruct00.var_1_5; [L72] COND TRUE stepLocal_0 > 2 [L73] EXPR WrapperStruct00.var_1_8 [L73] EXPR WrapperStruct00.var_1_9 [L73] EXPR WrapperStruct00.var_1_10 [L73] WrapperStruct00.var_1_7 = ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10) [L75] EXPR WrapperStruct00.var_1_17 [L75] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_17 [L76] EXPR WrapperStruct00.var_1_2 [L76] WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12 [L76] EXPR WrapperStruct00.var_1_12 [L76] WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1] [L76] COND FALSE !(WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) [L79] EXPR WrapperStruct00.var_1_3 [L79] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] EXPR -25 << WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1] [L79] COND FALSE !(WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) [L82] EXPR WrapperStruct00.var_1_17 [L82] EXPR WrapperStruct00.var_1_15 [L82] WrapperStruct00.var_1_11 = (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR (! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) [L130] EXPR WrapperStruct00.var_1_1 [L130] EXPR WrapperStruct00.var_1_5 [L130] EXPR (! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1) [L130] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR (WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1 [L130] EXPR WrapperStruct00.var_1_7 [L130] EXPR WrapperStruct00.var_1_8 [L130] EXPR WrapperStruct00.var_1_9 [L130] EXPR WrapperStruct00.var_1_10 [L130] EXPR (WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L130] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1] [L130-L131] return ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_1 == ((signed short int) (((((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) < (WrapperStruct00.var_1_6)) ? ((WrapperStruct00.var_1_3 + (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : (WrapperStruct00.var_1_6))))) : (WrapperStruct00.var_1_1 == ((signed short int) WrapperStruct00.var_1_5))) && ((WrapperStruct00.var_1_5 > 2) ? (WrapperStruct00.var_1_7 == ((float) ((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) - WrapperStruct00.var_1_10))) : 1)) && ((WrapperStruct00.var_1_2 && WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_13 + ((((((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) < (WrapperStruct00.var_1_16)) ? (((((WrapperStruct00.var_1_14) > (WrapperStruct00.var_1_15)) ? (WrapperStruct00.var_1_14) : (WrapperStruct00.var_1_15)))) : (WrapperStruct00.var_1_16)))))) : ((WrapperStruct00.var_1_3 < (200 * (-25 << WrapperStruct00.var_1_18))) ? (WrapperStruct00.var_1_11 == ((unsigned short int) ((((((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) < 0 ) ? -(((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))) : (((((WrapperStruct00.var_1_17 - 10000)) > (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14))))) ? ((WrapperStruct00.var_1_17 - 10000)) : (((((WrapperStruct00.var_1_15) < (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_15) : (WrapperStruct00.var_1_14)))))))))) : (WrapperStruct00.var_1_11 == ((unsigned short int) (WrapperStruct00.var_1_17 - WrapperStruct00.var_1_15)))))) && (WrapperStruct00.var_1_18 == ((unsigned long int) WrapperStruct00.var_1_17)) ; [L140] RET, EXPR property() [L140] 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, 158 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.5s, OverallIterations: 9, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1275 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1272 mSDsluCounter, 5203 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3560 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4020 IncrementalHoareTripleChecker+Invalid, 4281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 1643 mSDtfsCounter, 4020 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 691 GetRequests, 628 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=8, InterpolantAutomatonStates: 58, 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, 8 MinimizatonAttempts, 27 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2048 NumberOfCodeBlocks, 2048 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2036 ConstructedInterpolants, 0 QuantifiedInterpolants, 3143 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1295 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 13143/13200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:45:04,139 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-86.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 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:45:06,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:45:06,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:45:06,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:45:06,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:45:06,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:45:06,123 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:45:06,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:45:06,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:45:06,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:45:06,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:45:06,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:45:06,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:45:06,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:45:06,125 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:45:06,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:45:06,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:45:06,127 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:45:06,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:45:06,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:45:06,127 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 -> 2633f484e0865e6e431657ee89a0a14b8fb20a20b6a1493f613e45a885039ef4 [2025-03-04 01:45:06,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:45:06,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:45:06,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:45:06,360 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:45:06,360 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:45:06,361 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-86.i [2025-03-04 01:45:07,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4670f090d/3b9907570ae341cfab77c6bd6b266d0c/FLAGfada42fbe [2025-03-04 01:45:07,794 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:45:07,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-86.i [2025-03-04 01:45:07,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4670f090d/3b9907570ae341cfab77c6bd6b266d0c/FLAGfada42fbe [2025-03-04 01:45:07,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4670f090d/3b9907570ae341cfab77c6bd6b266d0c [2025-03-04 01:45:07,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:45:07,825 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:45:07,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:45:07,826 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:45:07,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:45:07,831 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:45:07" (1/1) ... [2025-03-04 01:45:07,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0dc67f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:07, skipping insertion in model container [2025-03-04 01:45:07,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:45:07" (1/1) ... [2025-03-04 01:45:07,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:45:07,955 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-86.i[916,929] [2025-03-04 01:45:08,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:45:08,057 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:45:08,068 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-86.i[916,929] [2025-03-04 01:45:08,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:45:08,171 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:45:08,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08 WrapperNode [2025-03-04 01:45:08,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:45:08,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:45:08,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:45:08,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:45:08,180 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,249 INFO L138 Inliner]: procedures = 37, calls = 243, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 742 [2025-03-04 01:45:08,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:45:08,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:45:08,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:45:08,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:45:08,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,295 INFO L175 MemorySlicer]: Split 207 memory accesses to 2 slices as follows [2, 205]. 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-04 01:45:08,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,328 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:45:08,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:45:08,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:45:08,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:45:08,351 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (1/1) ... [2025-03-04 01:45:08,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:45:08,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:45:08,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:45:08,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:45:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:45:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:45:08,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:45:08,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:45:08,400 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:45:08,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:45:08,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:45:08,533 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:45:08,535 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:45:09,793 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~mem138#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem141#1;havoc property_#t~mem139#1;havoc property_#t~mem140#1;havoc property_#t~mem142#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~mem146#1;havoc property_#t~mem150#1;havoc property_#t~mem149#1;havoc property_#t~mem152#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem155#1;havoc property_#t~short158#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~short161#1;havoc property_#t~ite224#1;havoc property_#t~mem176#1;havoc property_#t~mem175#1;havoc property_#t~mem162#1;havoc property_#t~mem163#1;havoc property_#t~ite166#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~mem167#1;havoc property_#t~ite174#1;havoc property_#t~mem168#1;havoc property_#t~mem169#1;havoc property_#t~ite172#1;havoc property_#t~mem170#1;havoc property_#t~mem171#1;havoc property_#t~mem173#1;havoc property_#t~mem178#1;havoc property_#t~mem177#1;havoc property_#t~ite223#1;havoc property_#t~mem219#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~mem181#1;havoc property_#t~ite184#1;havoc property_#t~mem182#1;havoc property_#t~mem183#1;havoc property_#t~ite191#1;havoc property_#t~mem185#1;havoc property_#t~mem186#1;havoc property_#t~mem187#1;havoc property_#t~ite190#1;havoc property_#t~mem188#1;havoc property_#t~mem189#1;havoc property_#t~ite218#1;havoc property_#t~mem192#1;havoc property_#t~mem193#1;havoc property_#t~mem194#1;havoc property_#t~ite197#1;havoc property_#t~mem195#1;havoc property_#t~mem196#1;havoc property_#t~ite204#1;havoc property_#t~mem198#1;havoc property_#t~mem199#1;havoc property_#t~mem200#1;havoc property_#t~ite203#1;havoc property_#t~mem201#1;havoc property_#t~mem202#1;havoc property_#t~mem205#1;havoc property_#t~mem206#1;havoc property_#t~mem207#1;havoc property_#t~ite210#1;havoc property_#t~mem208#1;havoc property_#t~mem209#1;havoc property_#t~ite217#1;havoc property_#t~mem211#1;havoc property_#t~mem212#1;havoc property_#t~mem213#1;havoc property_#t~ite216#1;havoc property_#t~mem214#1;havoc property_#t~mem215#1;havoc property_#t~mem222#1;havoc property_#t~mem220#1;havoc property_#t~mem221#1;havoc property_#t~short225#1;havoc property_#t~mem227#1;havoc property_#t~mem226#1;havoc property_#t~short228#1; [2025-03-04 01:45:09,837 INFO L? ?]: Removed 247 outVars from TransFormulas that were not future-live. [2025-03-04 01:45:09,837 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:45:09,850 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:45:09,850 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:45:09,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:45:09 BoogieIcfgContainer [2025-03-04 01:45:09,851 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:45:09,854 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:45:09,854 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:45:09,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:45:09,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:45:07" (1/3) ... [2025-03-04 01:45:09,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fd999d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:45:09, skipping insertion in model container [2025-03-04 01:45:09,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:45:08" (2/3) ... [2025-03-04 01:45:09,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fd999d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:45:09, skipping insertion in model container [2025-03-04 01:45:09,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:45:09" (3/3) ... [2025-03-04 01:45:09,861 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-86.i [2025-03-04 01:45:09,871 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:45:09,872 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-86.i that has 2 procedures, 154 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:45:09,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:45:09,919 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;@27c566c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:45:09,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:45:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 127 states have internal predecessors, (180), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:45:09,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 01:45:09,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:09,936 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:09,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:09,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:09,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1947478120, now seen corresponding path program 1 times [2025-03-04 01:45:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:09,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916554255] [2025-03-04 01:45:09,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:09,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:09,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:09,954 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:09,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:45:10,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 01:45:10,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 01:45:10,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:10,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:10,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:45:10,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 608 proven. 0 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2025-03-04 01:45:10,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:10,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:10,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916554255] [2025-03-04 01:45:10,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1916554255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:10,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:10,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:45:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573537867] [2025-03-04 01:45:10,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:10,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:45:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:10,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:45:10,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:45:10,428 INFO L87 Difference]: Start difference. First operand has 154 states, 126 states have (on average 1.4285714285714286) internal successors, (180), 127 states have internal predecessors, (180), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:45:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:10,450 INFO L93 Difference]: Finished difference Result 302 states and 480 transitions. [2025-03-04 01:45:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:45:10,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 184 [2025-03-04 01:45:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:10,456 INFO L225 Difference]: With dead ends: 302 [2025-03-04 01:45:10,456 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 01:45:10,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:45:10,460 INFO L435 NwaCegarLoop]: 225 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, 225 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:10,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:45:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 01:45:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-04 01:45:10,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 124 states have internal predecessors, (175), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:45:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 225 transitions. [2025-03-04 01:45:10,502 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 225 transitions. Word has length 184 [2025-03-04 01:45:10,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:10,503 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 225 transitions. [2025-03-04 01:45:10,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:45:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2025-03-04 01:45:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 01:45:10,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:10,506 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:10,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:45:10,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:10,707 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:10,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1392252501, now seen corresponding path program 1 times [2025-03-04 01:45:10,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:10,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917208188] [2025-03-04 01:45:10,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:10,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:10,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:10,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:10,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:45:10,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 01:45:11,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 01:45:11,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:11,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:11,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:45:11,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:11,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:45:11,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:11,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:11,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917208188] [2025-03-04 01:45:11,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917208188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:11,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:11,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:45:11,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569503433] [2025-03-04 01:45:11,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:11,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:45:11,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:11,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:45:11,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:45:11,151 INFO L87 Difference]: Start difference. First operand 151 states and 225 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:45:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:11,232 INFO L93 Difference]: Finished difference Result 304 states and 454 transitions. [2025-03-04 01:45:11,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:45:11,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 184 [2025-03-04 01:45:11,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:11,234 INFO L225 Difference]: With dead ends: 304 [2025-03-04 01:45:11,234 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 01:45:11,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:45:11,235 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 1 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:11,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 867 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:45:11,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 01:45:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-03-04 01:45:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.3984375) internal successors, (179), 128 states have internal predecessors, (179), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:45:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 229 transitions. [2025-03-04 01:45:11,246 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 229 transitions. Word has length 184 [2025-03-04 01:45:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:11,249 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 229 transitions. [2025-03-04 01:45:11,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:45:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 229 transitions. [2025-03-04 01:45:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-04 01:45:11,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:11,253 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:11,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:45:11,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:11,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:11,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:11,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1393176022, now seen corresponding path program 1 times [2025-03-04 01:45:11,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:11,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414669081] [2025-03-04 01:45:11,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:11,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:11,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:11,457 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:11,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:45:11,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-04 01:45:11,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-04 01:45:11,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:11,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:11,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:45:11,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:11,976 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-04 01:45:12,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2025-03-04 01:45:12,001 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:12,001 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:12,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414669081] [2025-03-04 01:45:12,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414669081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:12,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:12,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:45:12,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323035251] [2025-03-04 01:45:12,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:12,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:45:12,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:12,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:45:12,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:45:12,002 INFO L87 Difference]: Start difference. First operand 155 states and 229 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:45:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:13,240 INFO L93 Difference]: Finished difference Result 308 states and 456 transitions. [2025-03-04 01:45:13,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:45:13,241 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 184 [2025-03-04 01:45:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:13,242 INFO L225 Difference]: With dead ends: 308 [2025-03-04 01:45:13,242 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 01:45:13,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 179 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-04 01:45:13,243 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 187 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:13,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 678 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:45:13,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 01:45:13,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-03-04 01:45:13,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.390625) internal successors, (178), 128 states have internal predecessors, (178), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:45:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 228 transitions. [2025-03-04 01:45:13,257 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 228 transitions. Word has length 184 [2025-03-04 01:45:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:13,257 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 228 transitions. [2025-03-04 01:45:13,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:45:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 228 transitions. [2025-03-04 01:45:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 01:45:13,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:13,259 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:13,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:45:13,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:13,459 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:13,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:13,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1869984404, now seen corresponding path program 1 times [2025-03-04 01:45:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:13,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130403468] [2025-03-04 01:45:13,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:13,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:13,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:13,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:13,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:45:13,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 01:45:13,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 01:45:13,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:13,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:13,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:45:13,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:13,947 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-04 01:45:13,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-03-04 01:45:13,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:13,972 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:13,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130403468] [2025-03-04 01:45:13,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130403468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:13,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:13,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:45:13,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542160568] [2025-03-04 01:45:13,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:13,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:45:13,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:13,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:45:13,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:45:13,974 INFO L87 Difference]: Start difference. First operand 155 states and 228 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:45:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:15,268 INFO L93 Difference]: Finished difference Result 308 states and 454 transitions. [2025-03-04 01:45:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:45:15,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 186 [2025-03-04 01:45:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:15,270 INFO L225 Difference]: With dead ends: 308 [2025-03-04 01:45:15,270 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 01:45:15,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 181 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-04 01:45:15,271 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 177 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:15,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 674 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:45:15,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 01:45:15,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-03-04 01:45:15,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.3828125) internal successors, (177), 128 states have internal predecessors, (177), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:45:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 227 transitions. [2025-03-04 01:45:15,284 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 227 transitions. Word has length 186 [2025-03-04 01:45:15,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:15,284 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 227 transitions. [2025-03-04 01:45:15,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:45:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 227 transitions. [2025-03-04 01:45:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-04 01:45:15,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:15,286 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:15,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:45:15,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:15,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:15,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:15,487 INFO L85 PathProgramCache]: Analyzing trace with hash -462282282, now seen corresponding path program 1 times [2025-03-04 01:45:15,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:15,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [776710953] [2025-03-04 01:45:15,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:15,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:15,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:15,490 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:15,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:45:15,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-04 01:45:15,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-04 01:45:15,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:15,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:15,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:45:15,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:15,967 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-04 01:45:15,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2025-03-04 01:45:15,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:45:15,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:15,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [776710953] [2025-03-04 01:45:15,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [776710953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:45:15,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:45:15,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:45:15,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068460937] [2025-03-04 01:45:15,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:15,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:45:15,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:15,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:45:15,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:45:15,984 INFO L87 Difference]: Start difference. First operand 155 states and 227 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:45:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:17,188 INFO L93 Difference]: Finished difference Result 308 states and 452 transitions. [2025-03-04 01:45:17,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:45:17,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 188 [2025-03-04 01:45:17,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:17,190 INFO L225 Difference]: With dead ends: 308 [2025-03-04 01:45:17,190 INFO L226 Difference]: Without dead ends: 156 [2025-03-04 01:45:17,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 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-04 01:45:17,191 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 169 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:17,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 670 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:45:17,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-04 01:45:17,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2025-03-04 01:45:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 128 states have (on average 1.375) internal successors, (176), 128 states have internal predecessors, (176), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 01:45:17,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2025-03-04 01:45:17,203 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 188 [2025-03-04 01:45:17,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:17,203 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2025-03-04 01:45:17,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 01:45:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2025-03-04 01:45:17,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 01:45:17,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:17,204 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:17,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:45:17,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:17,405 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:17,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:17,407 INFO L85 PathProgramCache]: Analyzing trace with hash -904714092, now seen corresponding path program 1 times [2025-03-04 01:45:17,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:17,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802098953] [2025-03-04 01:45:17,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:17,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:17,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:17,409 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:17,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:45:17,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 01:45:17,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 01:45:17,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:17,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:17,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-03-04 01:45:17,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:17,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:45:18,002 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 26 treesize of output 25 [2025-03-04 01:45:18,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:18,160 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 41 treesize of output 28 [2025-03-04 01:45:18,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:18,256 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 41 treesize of output 28 [2025-03-04 01:45:18,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:18,347 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 41 treesize of output 28 [2025-03-04 01:45:18,436 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:18,436 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 41 treesize of output 28 [2025-03-04 01:45:18,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:18,526 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 41 treesize of output 28 [2025-03-04 01:45:18,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:18,619 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 41 treesize of output 28 [2025-03-04 01:45:18,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:18,719 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 36 treesize of output 38 [2025-03-04 01:45:18,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:18,870 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 51 treesize of output 41 [2025-03-04 01:45:19,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:19,006 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 51 treesize of output 41 [2025-03-04 01:45:19,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:19,153 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 51 treesize of output 50 [2025-03-04 01:45:19,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:19,260 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 77 treesize of output 58 [2025-03-04 01:45:19,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:19,335 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 79 treesize of output 78 [2025-03-04 01:45:19,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:19,457 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 109 treesize of output 99 [2025-03-04 01:45:19,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:19,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 149 treesize of output 65 [2025-03-04 01:45:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 778 proven. 51 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2025-03-04 01:45:19,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:45:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:45:19,850 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:19,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802098953] [2025-03-04 01:45:19,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802098953] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:45:19,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:45:19,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 19 [2025-03-04 01:45:19,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421051148] [2025-03-04 01:45:19,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:19,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:45:19,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:19,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:45:19,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:45:19,851 INFO L87 Difference]: Start difference. First operand 155 states and 226 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:45:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:22,063 INFO L93 Difference]: Finished difference Result 422 states and 614 transitions. [2025-03-04 01:45:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:45:22,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2025-03-04 01:45:22,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:22,065 INFO L225 Difference]: With dead ends: 422 [2025-03-04 01:45:22,065 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 01:45:22,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:45:22,066 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 146 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:22,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 757 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 01:45:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 01:45:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 249. [2025-03-04 01:45:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 215 states have (on average 1.4093023255813955) internal successors, (303), 216 states have internal predecessors, (303), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:45:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 365 transitions. [2025-03-04 01:45:22,077 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 365 transitions. Word has length 190 [2025-03-04 01:45:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:22,077 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 365 transitions. [2025-03-04 01:45:22,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:45:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 365 transitions. [2025-03-04 01:45:22,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 01:45:22,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:22,079 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:22,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:45:22,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:22,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:22,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash 613018770, now seen corresponding path program 1 times [2025-03-04 01:45:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443367290] [2025-03-04 01:45:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:22,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:22,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:22,283 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:22,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:45:22,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 01:45:22,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 01:45:22,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:22,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:22,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 01:45:22,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:22,821 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 14 treesize of output 10 [2025-03-04 01:45:22,954 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 36 treesize of output 29 [2025-03-04 01:45:23,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:23,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2025-03-04 01:45:23,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:23,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 50 [2025-03-04 01:45:23,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:23,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 63 [2025-03-04 01:45:23,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:23,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-04 01:45:23,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:23,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-04 01:45:24,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:24,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-04 01:45:24,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:24,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 66 [2025-03-04 01:45:24,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:24,463 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 65 treesize of output 76 [2025-03-04 01:45:24,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:24,738 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 75 treesize of output 89 [2025-03-04 01:45:25,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:25,025 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 85 treesize of output 102 [2025-03-04 01:45:25,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:25,337 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 95 treesize of output 115 [2025-03-04 01:45:25,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:25,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 105 treesize of output 128 [2025-03-04 01:45:26,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:26,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 124 treesize of output 144 [2025-03-04 01:45:26,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:26,778 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 139 treesize of output 147 [2025-03-04 01:45:26,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 1014 proven. 69 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-04 01:45:26,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:45:27,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:45:27,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443367290] [2025-03-04 01:45:27,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443367290] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:45:27,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:45:27,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 22 [2025-03-04 01:45:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033884488] [2025-03-04 01:45:27,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:27,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:45:27,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:27,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:45:27,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:45:27,006 INFO L87 Difference]: Start difference. First operand 249 states and 365 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:45:28,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:28,291 INFO L93 Difference]: Finished difference Result 494 states and 723 transitions. [2025-03-04 01:45:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:45:28,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2025-03-04 01:45:28,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:28,294 INFO L225 Difference]: With dead ends: 494 [2025-03-04 01:45:28,294 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 01:45:28,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:45:28,295 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 200 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:28,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 568 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:45:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 01:45:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2025-03-04 01:45:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 210 states have (on average 1.3952380952380952) internal successors, (293), 211 states have internal predecessors, (293), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:45:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 355 transitions. [2025-03-04 01:45:28,317 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 355 transitions. Word has length 192 [2025-03-04 01:45:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:28,318 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 355 transitions. [2025-03-04 01:45:28,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:45:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 355 transitions. [2025-03-04 01:45:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 01:45:28,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:28,319 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:28,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:45:28,520 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-04 01:45:28,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:28,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2120570579, now seen corresponding path program 1 times [2025-03-04 01:45:28,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:28,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092490496] [2025-03-04 01:45:28,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:28,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:28,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:28,524 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-04 01:45:28,524 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-04 01:45:28,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 01:45:29,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 01:45:29,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:29,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:29,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 01:45:29,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:29,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:45:29,049 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 31 treesize of output 15 [2025-03-04 01:45:29,076 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 26 treesize of output 25 [2025-03-04 01:45:29,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:29,198 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 36 treesize of output 38 [2025-03-04 01:45:29,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:29,320 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 51 treesize of output 41 [2025-03-04 01:45:29,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:29,405 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 51 treesize of output 41 [2025-03-04 01:45:29,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:29,491 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 51 treesize of output 41 [2025-03-04 01:45:29,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:29,562 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 51 treesize of output 41 [2025-03-04 01:45:29,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:29,656 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 46 treesize of output 51 [2025-03-04 01:45:29,785 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:29,785 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 56 treesize of output 64 [2025-03-04 01:45:29,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:29,984 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 66 treesize of output 77 [2025-03-04 01:45:30,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:30,229 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 76 treesize of output 90 [2025-03-04 01:45:30,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:30,474 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 86 treesize of output 103 [2025-03-04 01:45:30,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:30,754 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 96 treesize of output 116 [2025-03-04 01:45:31,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:31,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 104 treesize of output 127 [2025-03-04 01:45:31,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:31,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 119 treesize of output 130 [2025-03-04 01:45:31,503 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:31,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 121 treesize of output 141 [2025-03-04 01:45:31,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:31,724 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 151 treesize of output 162 [2025-03-04 01:45:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 1014 proven. 69 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-03-04 01:45:31,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:45:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:45:32,081 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:32,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092490496] [2025-03-04 01:45:32,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092490496] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:45:32,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:45:32,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 22 [2025-03-04 01:45:32,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657627653] [2025-03-04 01:45:32,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:32,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:45:32,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:32,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:45:32,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:45:32,082 INFO L87 Difference]: Start difference. First operand 244 states and 355 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:45:33,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:33,402 INFO L93 Difference]: Finished difference Result 489 states and 710 transitions. [2025-03-04 01:45:33,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:45:33,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2025-03-04 01:45:33,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:33,404 INFO L225 Difference]: With dead ends: 489 [2025-03-04 01:45:33,404 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 01:45:33,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:45:33,405 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 194 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:33,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 592 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:45:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 01:45:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2025-03-04 01:45:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 210 states have (on average 1.3904761904761904) internal successors, (292), 211 states have internal predecessors, (292), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:45:33,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 354 transitions. [2025-03-04 01:45:33,413 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 354 transitions. Word has length 192 [2025-03-04 01:45:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:33,414 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 354 transitions. [2025-03-04 01:45:33,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:45:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 354 transitions. [2025-03-04 01:45:33,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 01:45:33,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:33,415 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:33,429 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-04 01:45:33,615 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-04 01:45:33,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:33,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:33,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1092896178, now seen corresponding path program 1 times [2025-03-04 01:45:33,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:33,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986525691] [2025-03-04 01:45:33,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:33,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:33,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:33,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:33,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:45:33,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-04 01:45:34,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-04 01:45:34,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:45:34,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:45:34,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-04 01:45:34,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:45:34,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:45:34,138 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 31 treesize of output 15 [2025-03-04 01:45:34,162 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 26 treesize of output 25 [2025-03-04 01:45:34,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,223 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 36 treesize of output 38 [2025-03-04 01:45:34,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,324 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 46 treesize of output 51 [2025-03-04 01:45:34,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,446 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 61 treesize of output 54 [2025-03-04 01:45:34,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,544 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 61 treesize of output 54 [2025-03-04 01:45:34,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,641 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 61 treesize of output 54 [2025-03-04 01:45:34,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,736 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 56 treesize of output 64 [2025-03-04 01:45:34,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:34,892 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 66 treesize of output 77 [2025-03-04 01:45:35,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:35,105 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 76 treesize of output 90 [2025-03-04 01:45:35,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:35,319 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 86 treesize of output 103 [2025-03-04 01:45:35,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:35,578 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 101 treesize of output 106 [2025-03-04 01:45:35,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:35,791 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 96 treesize of output 116 [2025-03-04 01:45:36,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:36,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 122 treesize of output 133 [2025-03-04 01:45:36,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:36,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 132 treesize of output 137 [2025-03-04 01:45:36,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:36,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 134 treesize of output 148 [2025-03-04 01:45:36,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:36,693 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 164 treesize of output 169 [2025-03-04 01:45:36,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:45:36,915 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 170 treesize of output 70 [2025-03-04 01:45:36,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 1038 proven. 69 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-04 01:45:36,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:45:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 01:45:37,127 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:45:37,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986525691] [2025-03-04 01:45:37,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986525691] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:45:37,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:45:37,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 22 [2025-03-04 01:45:37,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711364241] [2025-03-04 01:45:37,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:45:37,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:45:37,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:45:37,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:45:37,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:45:37,128 INFO L87 Difference]: Start difference. First operand 244 states and 354 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:45:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:45:38,703 INFO L93 Difference]: Finished difference Result 483 states and 700 transitions. [2025-03-04 01:45:38,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:45:38,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 192 [2025-03-04 01:45:38,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:45:38,705 INFO L225 Difference]: With dead ends: 483 [2025-03-04 01:45:38,705 INFO L226 Difference]: Without dead ends: 242 [2025-03-04 01:45:38,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:45:38,706 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 200 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:45:38,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 391 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 01:45:38,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-04 01:45:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 238. [2025-03-04 01:45:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 204 states have (on average 1.3872549019607843) internal successors, (283), 205 states have internal predecessors, (283), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 01:45:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 345 transitions. [2025-03-04 01:45:38,714 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 345 transitions. Word has length 192 [2025-03-04 01:45:38,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:45:38,716 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 345 transitions. [2025-03-04 01:45:38,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 01:45:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 345 transitions. [2025-03-04 01:45:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-04 01:45:38,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:45:38,718 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:45:38,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:45:38,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:38,918 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:45:38,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:45:38,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1063151794, now seen corresponding path program 1 times [2025-03-04 01:45:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:45:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663565704] [2025-03-04 01:45:38,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:45:38,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:45:38,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:45:38,921 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:45:38,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:45:39,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes.