./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.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 8dc85e0a8f6bbccc0e2b973260306c777c44b967399a6b0d7a80a450a59c71c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:02:26,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:02:26,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:02:26,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:02:26,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:02:26,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:02:26,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:02:26,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:02:26,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:02:26,595 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:02:26,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:02:26,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:02:26,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:02:26,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:02:26,596 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:02:26,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:02:26,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:26,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:02:26,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:02:26,598 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:02:26,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:02:26,598 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:02:26,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:02:26,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:02:26,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:02:26,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:02:26,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:02:26,598 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 -> 8dc85e0a8f6bbccc0e2b973260306c777c44b967399a6b0d7a80a450a59c71c9 [2025-03-17 06:02:26,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:02:26,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:02:26,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:02:26,848 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:02:26,848 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:02:26,849 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-82.i [2025-03-17 06:02:28,077 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc026c4b/59695ca778c64f2c9e51a652aff64610/FLAGb9eef7e48 [2025-03-17 06:02:28,341 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:02:28,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i [2025-03-17 06:02:28,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc026c4b/59695ca778c64f2c9e51a652aff64610/FLAGb9eef7e48 [2025-03-17 06:02:28,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc026c4b/59695ca778c64f2c9e51a652aff64610 [2025-03-17 06:02:28,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:02:28,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:02:28,675 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:28,675 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:02:28,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:02:28,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf7dd99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28, skipping insertion in model container [2025-03-17 06:02:28,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:02:28,797 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-82.i[916,929] [2025-03-17 06:02:28,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:28,850 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:02:28,857 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-82.i[916,929] [2025-03-17 06:02:28,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:28,896 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:02:28,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28 WrapperNode [2025-03-17 06:02:28,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:28,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:28,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:02:28,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:02:28,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,946 INFO L138 Inliner]: procedures = 30, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 507 [2025-03-17 06:02:28,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:28,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:02:28,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:02:28,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:02:28,954 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,969 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:02:28,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,984 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,987 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:28,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:02:28,992 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:02:28,992 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:02:28,992 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:02:28,993 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (1/1) ... [2025-03-17 06:02:29,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:29,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:29,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:02:29,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:02:29,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:02:29,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:02:29,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:02:29,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:02:29,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:02:29,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:02:29,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:02:29,058 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:02:29,058 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:02:29,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:02:29,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:02:29,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:02:29,159 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:02:29,161 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:02:29,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem81#1;havoc property_#t~ite90#1;havoc property_#t~mem82#1;havoc property_#t~ite89#1;havoc property_#t~mem88#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~bitwise91#1;havoc property_#t~ite103#1;havoc property_#t~mem96#1;havoc property_#t~mem92#1;havoc property_#t~ite95#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem97#1;havoc property_#t~ite100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~short104#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite130#1;havoc property_#t~mem110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem115#1;havoc property_#t~ite127#1;havoc property_#t~mem121#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1;havoc property_#t~mem133#1;havoc property_#t~mem132#1;havoc property_#t~short134#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~short140#1; [2025-03-17 06:02:29,623 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2025-03-17 06:02:29,623 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:02:29,635 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:02:29,636 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:02:29,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:29 BoogieIcfgContainer [2025-03-17 06:02:29,636 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:02:29,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:02:29,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:02:29,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:02:29,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:02:28" (1/3) ... [2025-03-17 06:02:29,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d97a9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:29, skipping insertion in model container [2025-03-17 06:02:29,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:28" (2/3) ... [2025-03-17 06:02:29,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d97a9e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:29, skipping insertion in model container [2025-03-17 06:02:29,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:29" (3/3) ... [2025-03-17 06:02:29,644 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-82.i [2025-03-17 06:02:29,658 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:02:29,659 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-82.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:02:29,706 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:02:29,719 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;@a90b41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:02:29,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:02:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:02:29,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:29,734 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:29,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:29,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1843815799, now seen corresponding path program 1 times [2025-03-17 06:02:29,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:29,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564104294] [2025-03-17 06:02:29,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:29,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:29,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:29,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:29,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 06:02:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564104294] [2025-03-17 06:02:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564104294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618545399] [2025-03-17 06:02:30,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:30,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:30,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:30,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:02:30,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:02:30,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:30,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:30,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:30,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:30,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:02:30,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-17 06:02:30,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:30,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618545399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:30,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:30,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:02:30,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216052779] [2025-03-17 06:02:30,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:30,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:02:30,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:30,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:02:30,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:02:30,332 INFO L87 Difference]: Start difference. First operand has 109 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 93 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:02:30,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:30,354 INFO L93 Difference]: Finished difference Result 215 states and 334 transitions. [2025-03-17 06:02:30,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:02:30,357 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2025-03-17 06:02:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:30,362 INFO L225 Difference]: With dead ends: 215 [2025-03-17 06:02:30,362 INFO L226 Difference]: Without dead ends: 107 [2025-03-17 06:02:30,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:02:30,367 INFO L435 NwaCegarLoop]: 151 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, 151 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-17 06:02:30,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-17 06:02:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-17 06:02:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:30,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 153 transitions. [2025-03-17 06:02:30,404 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 153 transitions. Word has length 117 [2025-03-17 06:02:30,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:30,404 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 153 transitions. [2025-03-17 06:02:30,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:02:30,405 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 153 transitions. [2025-03-17 06:02:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:02:30,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:30,407 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:30,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 06:02:30,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:02:30,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:30,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash -974956972, now seen corresponding path program 1 times [2025-03-17 06:02:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:30,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630805895] [2025-03-17 06:02:30,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:30,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:30,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:30,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:30,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:30,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 06:02:31,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:31,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630805895] [2025-03-17 06:02:31,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630805895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:31,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864730393] [2025-03-17 06:02:31,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:31,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:31,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:02:31,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:02:31,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:31,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:31,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:31,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:31,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:02:31,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:31,272 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:31,272 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:31,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864730393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:31,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:31,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:02:31,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215791535] [2025-03-17 06:02:31,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:31,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:31,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:31,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:31,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:31,275 INFO L87 Difference]: Start difference. First operand 107 states and 153 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:31,321 INFO L93 Difference]: Finished difference Result 216 states and 309 transitions. [2025-03-17 06:02:31,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:31,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-17 06:02:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:31,324 INFO L225 Difference]: With dead ends: 216 [2025-03-17 06:02:31,325 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 06:02:31,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:31,328 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:31,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 06:02:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-17 06:02:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 93 states have internal predecessors, (127), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2025-03-17 06:02:31,341 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 117 [2025-03-17 06:02:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:31,342 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2025-03-17 06:02:31,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2025-03-17 06:02:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:02:31,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:31,345 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:31,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 06:02:31,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 06:02:31,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:31,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:31,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1512555861, now seen corresponding path program 1 times [2025-03-17 06:02:31,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:31,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908689164] [2025-03-17 06:02:31,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:31,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:31,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:31,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:31,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:31,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 06:02:31,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908689164] [2025-03-17 06:02:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908689164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732988259] [2025-03-17 06:02:31,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:31,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:31,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:31,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:02:31,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:02:31,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:31,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:31,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:31,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:31,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:02:31,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:31,957 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:31,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:31,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732988259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:31,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:31,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:02:31,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703181785] [2025-03-17 06:02:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:31,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:31,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:31,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:31,960 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:31,991 INFO L93 Difference]: Finished difference Result 220 states and 313 transitions. [2025-03-17 06:02:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:31,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-17 06:02:31,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:31,993 INFO L225 Difference]: With dead ends: 220 [2025-03-17 06:02:31,994 INFO L226 Difference]: Without dead ends: 112 [2025-03-17 06:02:31,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:31,997 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:31,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 434 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-17 06:02:32,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-17 06:02:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 95 states have internal predecessors, (129), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 157 transitions. [2025-03-17 06:02:32,009 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 157 transitions. Word has length 117 [2025-03-17 06:02:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:32,009 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 157 transitions. [2025-03-17 06:02:32,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 157 transitions. [2025-03-17 06:02:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:02:32,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:32,011 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:32,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:02:32,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:32,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:32,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:32,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1894907754, now seen corresponding path program 1 times [2025-03-17 06:02:32,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:32,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083212109] [2025-03-17 06:02:32,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:32,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:32,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:32,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:32,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:32,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 06:02:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083212109] [2025-03-17 06:02:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083212109] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037788340] [2025-03-17 06:02:32,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:32,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:32,395 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:02:32,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:02:32,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:32,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:32,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:32,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:32,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:02:32,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:32,597 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:32,598 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:32,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037788340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:32,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:32,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-17 06:02:32,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808989865] [2025-03-17 06:02:32,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:32,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:32,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:32,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:32,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:32,600 INFO L87 Difference]: Start difference. First operand 111 states and 157 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:32,622 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2025-03-17 06:02:32,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:32,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-17 06:02:32,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:32,623 INFO L225 Difference]: With dead ends: 224 [2025-03-17 06:02:32,623 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 06:02:32,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:02:32,624 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:32,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:32,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 06:02:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2025-03-17 06:02:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 97 states have internal predecessors, (131), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2025-03-17 06:02:32,630 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 117 [2025-03-17 06:02:32,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:32,630 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2025-03-17 06:02:32,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2025-03-17 06:02:32,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:02:32,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:32,632 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:32,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:02:32,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:32,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:32,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1893984233, now seen corresponding path program 1 times [2025-03-17 06:02:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:32,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154037205] [2025-03-17 06:02:32,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:32,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:32,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:32,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:32,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:32,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 06:02:32,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:32,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154037205] [2025-03-17 06:02:32,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154037205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:32,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107967320] [2025-03-17 06:02:32,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:32,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:32,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:32,979 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:02:32,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 06:02:33,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:33,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:33,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:33,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:33,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:02:33,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:33,189 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:33,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107967320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:33,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:33,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:02:33,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748124807] [2025-03-17 06:02:33,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:33,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:33,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:33,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:33,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:33,191 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:33,215 INFO L93 Difference]: Finished difference Result 227 states and 320 transitions. [2025-03-17 06:02:33,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:33,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-17 06:02:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:33,217 INFO L225 Difference]: With dead ends: 227 [2025-03-17 06:02:33,217 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 06:02:33,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:33,218 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 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-17 06:02:33,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 06:02:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-17 06:02:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2025-03-17 06:02:33,228 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 117 [2025-03-17 06:02:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:33,228 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2025-03-17 06:02:33,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2025-03-17 06:02:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 06:02:33,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:33,229 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:33,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 06:02:33,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:33,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:33,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:33,431 INFO L85 PathProgramCache]: Analyzing trace with hash 62297681, now seen corresponding path program 1 times [2025-03-17 06:02:33,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:33,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452548675] [2025-03-17 06:02:33,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:33,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:33,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 06:02:33,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 06:02:33,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:33,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:33,603 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-17 06:02:33,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452548675] [2025-03-17 06:02:33,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452548675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:02:33,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168011917] [2025-03-17 06:02:33,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:33,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:33,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:33,606 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:02:33,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 06:02:33,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 06:02:33,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 06:02:33,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:33,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:33,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:02:33,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:33,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:33,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168011917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:33,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:02:33,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 06:02:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952054971] [2025-03-17 06:02:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:33,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:02:33,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:33,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:02:33,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:02:33,828 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:33,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:33,859 INFO L93 Difference]: Finished difference Result 232 states and 325 transitions. [2025-03-17 06:02:33,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:02:33,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-17 06:02:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:33,860 INFO L225 Difference]: With dead ends: 232 [2025-03-17 06:02:33,860 INFO L226 Difference]: Without dead ends: 118 [2025-03-17 06:02:33,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:02:33,861 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:33,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-17 06:02:33,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-03-17 06:02:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2025-03-17 06:02:33,867 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 119 [2025-03-17 06:02:33,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:33,867 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2025-03-17 06:02:33,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2025-03-17 06:02:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:02:33,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:33,868 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:33,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 06:02:34,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:02:34,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:34,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:34,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1657712243, now seen corresponding path program 1 times [2025-03-17 06:02:34,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:34,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733088584] [2025-03-17 06:02:34,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:34,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:34,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:02:34,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:02:34,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:34,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:34,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:34,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733088584] [2025-03-17 06:02:34,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733088584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:34,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:34,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369971876] [2025-03-17 06:02:34,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:34,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:34,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:34,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:34,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:34,553 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:34,863 INFO L93 Difference]: Finished difference Result 345 states and 483 transitions. [2025-03-17 06:02:34,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:02:34,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-17 06:02:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:34,865 INFO L225 Difference]: With dead ends: 345 [2025-03-17 06:02:34,865 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 06:02:34,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:02:34,866 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 130 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:34,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 537 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:02:34,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 06:02:34,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 164. [2025-03-17 06:02:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 133 states have (on average 1.3157894736842106) internal successors, (175), 133 states have internal predecessors, (175), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:02:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 231 transitions. [2025-03-17 06:02:34,874 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 231 transitions. Word has length 121 [2025-03-17 06:02:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:34,875 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 231 transitions. [2025-03-17 06:02:34,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 231 transitions. [2025-03-17 06:02:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:02:34,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:34,876 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:34,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:02:34,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:34,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:34,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1614377463, now seen corresponding path program 1 times [2025-03-17 06:02:34,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:34,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645641079] [2025-03-17 06:02:34,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:34,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:02:34,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:02:34,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:34,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:35,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:35,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645641079] [2025-03-17 06:02:35,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645641079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:35,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:35,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:35,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114567957] [2025-03-17 06:02:35,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:35,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:35,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:35,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:35,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:35,068 INFO L87 Difference]: Start difference. First operand 164 states and 231 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:35,195 INFO L93 Difference]: Finished difference Result 274 states and 385 transitions. [2025-03-17 06:02:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:35,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 121 [2025-03-17 06:02:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:35,197 INFO L225 Difference]: With dead ends: 274 [2025-03-17 06:02:35,197 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 06:02:35,198 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-17 06:02:35,198 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:35,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 360 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:02:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 06:02:35,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-03-17 06:02:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 128 states have (on average 1.3046875) internal successors, (167), 128 states have internal predecessors, (167), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:02:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 223 transitions. [2025-03-17 06:02:35,206 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 223 transitions. Word has length 121 [2025-03-17 06:02:35,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:35,206 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 223 transitions. [2025-03-17 06:02:35,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:35,207 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 223 transitions. [2025-03-17 06:02:35,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 06:02:35,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:35,207 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:35,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:02:35,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:35,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:35,208 INFO L85 PathProgramCache]: Analyzing trace with hash -628831390, now seen corresponding path program 1 times [2025-03-17 06:02:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:35,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426487275] [2025-03-17 06:02:35,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:35,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 06:02:35,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 06:02:35,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:35,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:35,338 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:35,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:35,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426487275] [2025-03-17 06:02:35,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426487275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:35,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:35,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:35,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898456047] [2025-03-17 06:02:35,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:35,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:35,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:35,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:35,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:35,340 INFO L87 Difference]: Start difference. First operand 159 states and 223 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:35,563 INFO L93 Difference]: Finished difference Result 337 states and 467 transitions. [2025-03-17 06:02:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:02:35,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 122 [2025-03-17 06:02:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:35,565 INFO L225 Difference]: With dead ends: 337 [2025-03-17 06:02:35,565 INFO L226 Difference]: Without dead ends: 227 [2025-03-17 06:02:35,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:02:35,566 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 68 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:35,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 671 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:02:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-17 06:02:35,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 191. [2025-03-17 06:02:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 160 states have (on average 1.325) internal successors, (212), 160 states have internal predecessors, (212), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:02:35,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 268 transitions. [2025-03-17 06:02:35,578 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 268 transitions. Word has length 122 [2025-03-17 06:02:35,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:35,578 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 268 transitions. [2025-03-17 06:02:35,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:35,579 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 268 transitions. [2025-03-17 06:02:35,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-17 06:02:35,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:35,579 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:35,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:02:35,580 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:35,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:35,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1337004638, now seen corresponding path program 1 times [2025-03-17 06:02:35,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:35,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275705232] [2025-03-17 06:02:35,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:35,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:35,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 06:02:35,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 06:02:35,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:35,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:37,091 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:37,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:37,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275705232] [2025-03-17 06:02:37,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275705232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:37,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:37,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:02:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41573019] [2025-03-17 06:02:37,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:37,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:02:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:37,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:02:37,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:02:37,094 INFO L87 Difference]: Start difference. First operand 191 states and 268 transitions. Second operand has 12 states, 10 states have (on average 5.5) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 06:02:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:37,965 INFO L93 Difference]: Finished difference Result 441 states and 618 transitions. [2025-03-17 06:02:37,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:02:37,966 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-03-17 06:02:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:37,967 INFO L225 Difference]: With dead ends: 441 [2025-03-17 06:02:37,967 INFO L226 Difference]: Without dead ends: 301 [2025-03-17 06:02:37,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-03-17 06:02:37,968 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 99 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:37,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1122 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 06:02:37,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-03-17 06:02:37,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 298. [2025-03-17 06:02:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 260 states have (on average 1.35) internal successors, (351), 261 states have internal predecessors, (351), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:02:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 419 transitions. [2025-03-17 06:02:37,984 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 419 transitions. Word has length 122 [2025-03-17 06:02:37,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:37,985 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 419 transitions. [2025-03-17 06:02:37,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.5) internal successors, (55), 12 states have internal predecessors, (55), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 06:02:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 419 transitions. [2025-03-17 06:02:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-17 06:02:37,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:37,986 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:37,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 06:02:37,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:37,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:37,987 INFO L85 PathProgramCache]: Analyzing trace with hash -884764548, now seen corresponding path program 1 times [2025-03-17 06:02:37,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:37,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073243500] [2025-03-17 06:02:37,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:37,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:38,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-17 06:02:38,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-17 06:02:38,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:38,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:38,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:38,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073243500] [2025-03-17 06:02:38,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073243500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:38,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:38,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 06:02:38,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768035803] [2025-03-17 06:02:38,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:38,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 06:02:38,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:38,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 06:02:38,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:02:38,080 INFO L87 Difference]: Start difference. First operand 298 states and 419 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:38,153 INFO L93 Difference]: Finished difference Result 659 states and 919 transitions. [2025-03-17 06:02:38,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 06:02:38,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-17 06:02:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:38,156 INFO L225 Difference]: With dead ends: 659 [2025-03-17 06:02:38,158 INFO L226 Difference]: Without dead ends: 412 [2025-03-17 06:02:38,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 06:02:38,159 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 68 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:38,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 338 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:02:38,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-17 06:02:38,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 344. [2025-03-17 06:02:38,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 306 states have (on average 1.3496732026143792) internal successors, (413), 307 states have internal predecessors, (413), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:02:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2025-03-17 06:02:38,182 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 123 [2025-03-17 06:02:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:38,182 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2025-03-17 06:02:38,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2025-03-17 06:02:38,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:02:38,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:38,183 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:38,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 06:02:38,183 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:38,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1730116806, now seen corresponding path program 1 times [2025-03-17 06:02:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:38,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635331955] [2025-03-17 06:02:38,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:38,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:38,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:02:38,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:02:38,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:38,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:38,341 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:38,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:02:38,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635331955] [2025-03-17 06:02:38,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635331955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:38,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:38,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:38,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277045838] [2025-03-17 06:02:38,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:38,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:38,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:02:38,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:38,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:38,342 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:38,577 INFO L93 Difference]: Finished difference Result 694 states and 965 transitions. [2025-03-17 06:02:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:02:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 124 [2025-03-17 06:02:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:38,579 INFO L225 Difference]: With dead ends: 694 [2025-03-17 06:02:38,580 INFO L226 Difference]: Without dead ends: 403 [2025-03-17 06:02:38,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:02:38,581 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 70 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:38,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 945 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:02:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-17 06:02:38,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 286. [2025-03-17 06:02:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 248 states have (on average 1.3387096774193548) internal successors, (332), 249 states have internal predecessors, (332), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:02:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 400 transitions. [2025-03-17 06:02:38,604 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 400 transitions. Word has length 124 [2025-03-17 06:02:38,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:38,604 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 400 transitions. [2025-03-17 06:02:38,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:38,606 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 400 transitions. [2025-03-17 06:02:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-17 06:02:38,608 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:38,608 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:38,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 06:02:38,609 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:38,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2104268180, now seen corresponding path program 1 times [2025-03-17 06:02:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:02:38,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547967430] [2025-03-17 06:02:38,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:02:38,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:02:38,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:02:38,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:38,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:02:38,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:02:38,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 06:02:38,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 06:02:38,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:38,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:02:38,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:02:38,878 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:02:38,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:02:38,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 06:02:38,885 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:38,949 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:02:38,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:02:38 BoogieIcfgContainer [2025-03-17 06:02:38,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:02:38,954 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:02:38,954 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:02:38,954 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:02:38,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:29" (3/4) ... [2025-03-17 06:02:38,956 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:02:38,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:02:38,958 INFO L158 Benchmark]: Toolchain (without parser) took 10283.74ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 124.1MB in the beginning and 239.0MB in the end (delta: -114.9MB). Peak memory consumption was 149.2MB. Max. memory is 16.1GB. [2025-03-17 06:02:38,958 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:02:38,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.66ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 106.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:02:38,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.37ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 103.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:02:38,959 INFO L158 Benchmark]: Boogie Preprocessor took 44.72ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 99.6MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:02:38,959 INFO L158 Benchmark]: IcfgBuilder took 643.84ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 60.7MB in the end (delta: 39.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:02:38,959 INFO L158 Benchmark]: TraceAbstraction took 9315.74ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 59.7MB in the beginning and 239.1MB in the end (delta: -179.4MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. [2025-03-17 06:02:38,959 INFO L158 Benchmark]: Witness Printer took 3.15ms. Allocated memory is still 436.2MB. Free memory was 239.1MB in the beginning and 239.0MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:02:38,960 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.66ms. Allocated memory is still 167.8MB. Free memory was 124.1MB in the beginning and 106.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.37ms. Allocated memory is still 167.8MB. Free memory was 106.9MB in the beginning and 103.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.72ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 99.6MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 643.84ms. Allocated memory is still 167.8MB. Free memory was 99.6MB in the beginning and 60.7MB in the end (delta: 39.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9315.74ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 59.7MB in the beginning and 239.1MB in the end (delta: -179.4MB). Peak memory consumption was 82.1MB. Max. memory is 16.1GB. * Witness Printer took 3.15ms. Allocated memory is still 436.2MB. Free memory was 239.1MB in the beginning and 239.0MB in the end (delta: 72.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 118. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 128.75, 1, 63.5, 255.5, 32, 25, 128, 16, 2, 5, 10, 3.75, 0, 255.5 }; [L55] unsigned char last_1_WrapperStruct00_var_1_5 = 32; [L56] unsigned char last_1_WrapperStruct00_var_1_12 = 2; [L57] unsigned char last_1_WrapperStruct00_var_1_17 = 0; [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L113] EXPR WrapperStruct00.var_1_5 [L113] last_1_WrapperStruct00_var_1_5 = WrapperStruct00.var_1_5 [L114] EXPR WrapperStruct00.var_1_12 [L114] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L115] EXPR WrapperStruct00.var_1_17 [L115] last_1_WrapperStruct00_var_1_17 = WrapperStruct00.var_1_17 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L89] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L91] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L94] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L96] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L98] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L101] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L102] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L105] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L108] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L126] RET updateVariables() [L127] CALL step() [L61] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L61] signed long int stepLocal_0 = last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12; [L62] COND FALSE !((last_1_WrapperStruct00_var_1_5 / -2) >= stepLocal_0) [L65] EXPR WrapperStruct00.var_1_10 [L65] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L65] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) [L65] EXPR WrapperStruct00.var_1_11 [L65] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L65] WrapperStruct00.var_1_5 = (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) [L67] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L67] COND FALSE !(! WrapperStruct00.var_1_2) [L72] EXPR WrapperStruct00.var_1_4 [L72] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_4 [L73] EXPR WrapperStruct00.var_1_9 [L73] WrapperStruct00.var_1_17 = WrapperStruct00.var_1_9 [L74] EXPR WrapperStruct00.var_1_3 [L74] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_3 [L75] EXPR WrapperStruct00.var_1_9 [L75] unsigned char stepLocal_1 = WrapperStruct00.var_1_9; [L76] EXPR WrapperStruct00.var_1_5 [L76] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32, stepLocal_1=-122] [L76] COND FALSE !((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= stepLocal_1) [L85] EXPR WrapperStruct00.var_1_9 [L85] WrapperStruct00.var_1_12 = WrapperStruct00.var_1_9 [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) [L118] EXPR WrapperStruct00.var_1_5 [L118] EXPR WrapperStruct00.var_1_10 [L118] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) [L118] EXPR WrapperStruct00.var_1_11 [L118] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9))) [L118] EXPR WrapperStruct00.var_1_5 [L118] EXPR WrapperStruct00.var_1_11 [L118] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)) [L118] EXPR WrapperStruct00.var_1_12 [L118] EXPR WrapperStruct00.var_1_9 [L118] EXPR ((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4)) [L118] EXPR WrapperStruct00.var_1_16 [L118] EXPR WrapperStruct00.var_1_4 [L118] EXPR ((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR (((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9)) [L118] EXPR WrapperStruct00.var_1_17 [L118] EXPR WrapperStruct00.var_1_9 [L118] EXPR (((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118] EXPR ((((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9))) && (WrapperStruct00.var_1_18 == ((double) WrapperStruct00.var_1_3)) [L118] EXPR WrapperStruct00.var_1_18 [L118] EXPR WrapperStruct00.var_1_3 [L118] EXPR ((((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9))) && (WrapperStruct00.var_1_18 == ((double) WrapperStruct00.var_1_3)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L118-L119] return ((((((! WrapperStruct00.var_1_2) ? (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((float) ((((WrapperStruct00.var_1_3) > (WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_3) : (WrapperStruct00.var_1_4))))) : 1) : 1) && (((last_1_WrapperStruct00_var_1_5 / -2) >= (last_1_WrapperStruct00_var_1_17 | last_1_WrapperStruct00_var_1_12)) ? (WrapperStruct00.var_1_5 == ((unsigned char) ((((WrapperStruct00.var_1_9) < 0 ) ? -(WrapperStruct00.var_1_9) : (WrapperStruct00.var_1_9))))) : (WrapperStruct00.var_1_5 == ((unsigned char) (WrapperStruct00.var_1_10 - ((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))))) && (((WrapperStruct00.var_1_5 + WrapperStruct00.var_1_11) >= WrapperStruct00.var_1_9) ? ((((((WrapperStruct00.var_1_4) > ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3))) ? (WrapperStruct00.var_1_4) : ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_3)))) <= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_12 == ((unsigned char) ((((WrapperStruct00.var_1_11) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_12 == ((unsigned char) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_15))) : 1)) : (WrapperStruct00.var_1_12 == ((unsigned char) WrapperStruct00.var_1_9)))) && (WrapperStruct00.var_1_16 == ((double) WrapperStruct00.var_1_4))) && (WrapperStruct00.var_1_17 == ((unsigned char) WrapperStruct00.var_1_9))) && (WrapperStruct00.var_1_18 == ((double) WrapperStruct00.var_1_3)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_12=2, last_1_WrapperStruct00_var_1_17=0, last_1_WrapperStruct00_var_1_5=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 175 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 6440 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4599 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1480 IncrementalHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 1841 mSDtfsCounter, 1480 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 795 GetRequests, 727 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=11, InterpolantAutomatonStates: 60, 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, 12 MinimizatonAttempts, 295 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2265 NumberOfCodeBlocks, 2265 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2123 ConstructedInterpolants, 0 QuantifiedInterpolants, 3227 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2707 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 6331/6552 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:02:38,981 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-82.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 8dc85e0a8f6bbccc0e2b973260306c777c44b967399a6b0d7a80a450a59c71c9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:02:40,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:02:41,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:02:41,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:02:41,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:02:41,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:02:41,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:02:41,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:02:41,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:02:41,044 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:02:41,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:02:41,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:02:41,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:02:41,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:02:41,045 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:02:41,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:02:41,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:02:41,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:02:41,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:02:41,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:02:41,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:02:41,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:02:41,046 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:02:41,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:02:41,047 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:02:41,047 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:02:41,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:02:41,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:02:41,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:02:41,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:02:41,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:02:41,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:02:41,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:02:41,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:02:41,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:41,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:02:41,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:02:41,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:02:41,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:02:41,048 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:02:41,048 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:02:41,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:02:41,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:02:41,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:02:41,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:02:41,048 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 -> 8dc85e0a8f6bbccc0e2b973260306c777c44b967399a6b0d7a80a450a59c71c9 [2025-03-17 06:02:41,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:02:41,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:02:41,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:02:41,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:02:41,307 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:02:41,308 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-82.i [2025-03-17 06:02:42,485 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a12471b/53376c26fec24f69b3d2c7e7a8212c2e/FLAGac47d2d7f [2025-03-17 06:02:42,695 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:02:42,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-82.i [2025-03-17 06:02:42,702 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a12471b/53376c26fec24f69b3d2c7e7a8212c2e/FLAGac47d2d7f [2025-03-17 06:02:42,719 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a12471b/53376c26fec24f69b3d2c7e7a8212c2e [2025-03-17 06:02:42,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:02:42,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:02:42,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:42,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:02:42,728 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:02:42,729 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:42" (1/1) ... [2025-03-17 06:02:42,730 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5812e66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:42, skipping insertion in model container [2025-03-17 06:02:42,730 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:02:42" (1/1) ... [2025-03-17 06:02:42,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:02:42,854 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-82.i[916,929] [2025-03-17 06:02:42,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:42,933 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:02:42,942 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-82.i[916,929] [2025-03-17 06:02:42,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:02:43,013 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:02:43,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43 WrapperNode [2025-03-17 06:02:43,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:02:43,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:43,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:02:43,016 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:02:43,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,061 INFO L138 Inliner]: procedures = 34, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 489 [2025-03-17 06:02:43,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:02:43,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:02:43,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:02:43,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:02:43,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,101 INFO L175 MemorySlicer]: Split 134 memory accesses to 2 slices as follows [2, 132]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2025-03-17 06:02:43,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,121 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:02:43,129 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:02:43,129 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:02:43,129 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:02:43,130 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (1/1) ... [2025-03-17 06:02:43,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:02:43,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:02:43,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:02:43,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:02:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:02:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:02:43,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:02:43,177 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:02:43,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:02:43,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:02:43,298 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:02:43,301 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:02:45,157 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem80#1;havoc property_#t~ite89#1;havoc property_#t~mem81#1;havoc property_#t~ite88#1;havoc property_#t~mem87#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~ite86#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite101#1;havoc property_#t~mem94#1;havoc property_#t~mem90#1;havoc property_#t~ite93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem95#1;havoc property_#t~ite98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short102#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~ite128#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite112#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem113#1;havoc property_#t~ite125#1;havoc property_#t~mem119#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~ite118#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~ite124#1;havoc property_#t~mem123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem127#1;havoc property_#t~mem126#1;havoc property_#t~short129#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~short132#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~short135#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~short138#1; [2025-03-17 06:02:45,188 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-03-17 06:02:45,188 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:02:45,196 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:02:45,197 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:02:45,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:45 BoogieIcfgContainer [2025-03-17 06:02:45,197 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:02:45,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:02:45,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:02:45,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:02:45,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:02:42" (1/3) ... [2025-03-17 06:02:45,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671d96ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:45, skipping insertion in model container [2025-03-17 06:02:45,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:02:43" (2/3) ... [2025-03-17 06:02:45,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671d96ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:02:45, skipping insertion in model container [2025-03-17 06:02:45,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:02:45" (3/3) ... [2025-03-17 06:02:45,206 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-82.i [2025-03-17 06:02:45,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:02:45,218 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-82.i that has 2 procedures, 102 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:02:45,257 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:02:45,267 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;@2cae7c4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:02:45,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:02:45,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 06:02:45,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:45,281 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:45,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:45,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1250995838, now seen corresponding path program 1 times [2025-03-17 06:02:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567867844] [2025-03-17 06:02:45,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:45,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:45,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:45,298 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:45,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:02:45,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 06:02:45,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 06:02:45,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:45,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:45,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:02:45,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-17 06:02:45,604 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:45,605 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:45,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567867844] [2025-03-17 06:02:45,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567867844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:45,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:45,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:02:45,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204776729] [2025-03-17 06:02:45,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:45,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:02:45,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:45,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:02:45,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:02:45,629 INFO L87 Difference]: Start difference. First operand has 102 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:02:45,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:45,651 INFO L93 Difference]: Finished difference Result 201 states and 312 transitions. [2025-03-17 06:02:45,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:02:45,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2025-03-17 06:02:45,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:45,657 INFO L225 Difference]: With dead ends: 201 [2025-03-17 06:02:45,657 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 06:02:45,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:02:45,662 INFO L435 NwaCegarLoop]: 142 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, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:45,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:45,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 06:02:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-17 06:02:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-03-17 06:02:45,695 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 115 [2025-03-17 06:02:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:45,695 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-03-17 06:02:45,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-17 06:02:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-03-17 06:02:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 06:02:45,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:45,699 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:45,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 06:02:45,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:45,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:45,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:45,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1870710089, now seen corresponding path program 1 times [2025-03-17 06:02:45,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:45,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822447402] [2025-03-17 06:02:45,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:45,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:45,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:45,908 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:45,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:02:46,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 06:02:46,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 06:02:46,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:46,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:46,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:02:46,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:46,186 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:46,186 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:46,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822447402] [2025-03-17 06:02:46,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822447402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:46,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:46,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:46,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265040291] [2025-03-17 06:02:46,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:46,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:46,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:46,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:46,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:46,188 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:46,248 INFO L93 Difference]: Finished difference Result 201 states and 286 transitions. [2025-03-17 06:02:46,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:46,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-17 06:02:46,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:46,251 INFO L225 Difference]: With dead ends: 201 [2025-03-17 06:02:46,251 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 06:02:46,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:46,252 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:46,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 409 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 06:02:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 06:02:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-03-17 06:02:46,262 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 115 [2025-03-17 06:02:46,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:46,263 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-03-17 06:02:46,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:46,264 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-03-17 06:02:46,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:02:46,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:46,266 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:46,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:02:46,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:46,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:46,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash 272005635, now seen corresponding path program 1 times [2025-03-17 06:02:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29137018] [2025-03-17 06:02:46,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:46,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:46,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:46,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:46,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:02:46,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:02:46,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:02:46,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:46,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:46,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:02:46,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:46,749 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:46,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29137018] [2025-03-17 06:02:46,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29137018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:46,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:46,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:02:46,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524096792] [2025-03-17 06:02:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:46,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:02:46,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:46,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:02:46,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:46,751 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:46,815 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2025-03-17 06:02:46,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:02:46,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-17 06:02:46,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:46,819 INFO L225 Difference]: With dead ends: 206 [2025-03-17 06:02:46,819 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 06:02:46,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:46,820 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:46,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:02:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 06:02:46,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2025-03-17 06:02:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2025-03-17 06:02:46,830 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 117 [2025-03-17 06:02:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:46,831 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2025-03-17 06:02:46,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2025-03-17 06:02:46,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 06:02:46,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:46,835 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:46,847 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 (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:02:47,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:47,036 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:47,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:47,036 INFO L85 PathProgramCache]: Analyzing trace with hash 24520869, now seen corresponding path program 1 times [2025-03-17 06:02:47,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:47,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559064091] [2025-03-17 06:02:47,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:47,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:47,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:47,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:47,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:02:47,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 06:02:47,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 06:02:47,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:47,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:47,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:02:47,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:47,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:47,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:47,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559064091] [2025-03-17 06:02:47,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559064091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:47,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:47,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:47,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369453775] [2025-03-17 06:02:47,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:47,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:47,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:47,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:47,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:47,349 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:50,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:02:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:50,768 INFO L93 Difference]: Finished difference Result 200 states and 282 transitions. [2025-03-17 06:02:50,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-17 06:02:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:50,770 INFO L225 Difference]: With dead ends: 200 [2025-03-17 06:02:50,770 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 06:02:50,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:50,771 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:50,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 333 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-17 06:02:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 06:02:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 06:02:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2025-03-17 06:02:50,782 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 119 [2025-03-17 06:02:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:50,782 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2025-03-17 06:02:50,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2025-03-17 06:02:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 06:02:50,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:50,784 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:50,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:02:50,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:50,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:50,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1618844062, now seen corresponding path program 1 times [2025-03-17 06:02:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [433056210] [2025-03-17 06:02:50,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:50,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:50,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:50,991 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:50,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:02:51,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 06:02:51,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 06:02:51,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:51,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:51,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:02:51,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:51,204 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:51,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:51,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:51,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [433056210] [2025-03-17 06:02:51,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [433056210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:51,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:51,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:51,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712087620] [2025-03-17 06:02:51,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:51,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:51,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:51,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:51,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:51,206 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:51,315 INFO L93 Difference]: Finished difference Result 198 states and 277 transitions. [2025-03-17 06:02:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-17 06:02:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:51,317 INFO L225 Difference]: With dead ends: 198 [2025-03-17 06:02:51,318 INFO L226 Difference]: Without dead ends: 101 [2025-03-17 06:02:51,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:51,319 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:51,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 391 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:02:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-17 06:02:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-17 06:02:51,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3214285714285714) internal successors, (111), 84 states have internal predecessors, (111), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2025-03-17 06:02:51,329 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 119 [2025-03-17 06:02:51,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:51,329 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2025-03-17 06:02:51,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:51,329 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2025-03-17 06:02:51,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 06:02:51,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:51,330 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:51,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 06:02:51,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:51,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:51,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:51,531 INFO L85 PathProgramCache]: Analyzing trace with hash 868668771, now seen corresponding path program 1 times [2025-03-17 06:02:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:51,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470920492] [2025-03-17 06:02:51,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:51,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:51,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:51,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:51,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-17 06:02:51,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 06:02:51,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 06:02:51,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:51,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:51,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:02:51,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:51,740 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:51,740 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470920492] [2025-03-17 06:02:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470920492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:51,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:51,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:02:51,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040337552] [2025-03-17 06:02:51,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:51,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:02:51,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:51,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:02:51,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:51,742 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:51,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:51,863 INFO L93 Difference]: Finished difference Result 202 states and 281 transitions. [2025-03-17 06:02:51,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:02:51,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-17 06:02:51,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:51,864 INFO L225 Difference]: With dead ends: 202 [2025-03-17 06:02:51,865 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 06:02:51,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:51,866 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:51,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 513 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:02:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 06:02:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-17 06:02:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.313953488372093) internal successors, (113), 86 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2025-03-17 06:02:51,873 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 119 [2025-03-17 06:02:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:51,874 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2025-03-17 06:02:51,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2025-03-17 06:02:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 06:02:51,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:51,875 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:51,882 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 (7)] Forceful destruction successful, exit code 0 [2025-03-17 06:02:52,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:52,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:52,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1756172452, now seen corresponding path program 1 times [2025-03-17 06:02:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900997490] [2025-03-17 06:02:52,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:52,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:52,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:52,078 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:52,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-17 06:02:52,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 06:02:52,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 06:02:52,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:52,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:52,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 06:02:52,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:52,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:52,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:52,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900997490] [2025-03-17 06:02:52,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900997490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:52,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:52,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:02:52,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170748151] [2025-03-17 06:02:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:02:52,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:52,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:02:52,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:52,313 INFO L87 Difference]: Start difference. First operand 102 states and 141 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:52,503 INFO L93 Difference]: Finished difference Result 206 states and 285 transitions. [2025-03-17 06:02:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:02:52,503 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-17 06:02:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:52,504 INFO L225 Difference]: With dead ends: 206 [2025-03-17 06:02:52,504 INFO L226 Difference]: Without dead ends: 105 [2025-03-17 06:02:52,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:52,505 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:52,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 635 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:02:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-17 06:02:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-03-17 06:02:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3068181818181819) internal successors, (115), 88 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 143 transitions. [2025-03-17 06:02:52,510 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 143 transitions. Word has length 119 [2025-03-17 06:02:52,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:52,510 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 143 transitions. [2025-03-17 06:02:52,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:52,511 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 143 transitions. [2025-03-17 06:02:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 06:02:52,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:52,512 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:52,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-17 06:02:52,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:52,712 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:52,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1757095973, now seen corresponding path program 1 times [2025-03-17 06:02:52,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:52,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372666059] [2025-03-17 06:02:52,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:52,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:52,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:52,715 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:52,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-17 06:02:52,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 06:02:52,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 06:02:52,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:52,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:52,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:02:52,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:52,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:52,947 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:52,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372666059] [2025-03-17 06:02:52,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372666059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:52,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:52,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:52,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583079986] [2025-03-17 06:02:52,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:52,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:02:52,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:52,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:02:52,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:52,948 INFO L87 Difference]: Start difference. First operand 104 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:53,359 INFO L93 Difference]: Finished difference Result 259 states and 356 transitions. [2025-03-17 06:02:53,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:02:53,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-17 06:02:53,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:53,361 INFO L225 Difference]: With dead ends: 259 [2025-03-17 06:02:53,361 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 06:02:53,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:02:53,362 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 57 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:53,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 390 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:02:53,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 06:02:53,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 124. [2025-03-17 06:02:53,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 06:02:53,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2025-03-17 06:02:53,367 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 119 [2025-03-17 06:02:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:53,367 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2025-03-17 06:02:53,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2025-03-17 06:02:53,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 06:02:53,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:53,368 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:53,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-17 06:02:53,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:53,569 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:53,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:53,570 INFO L85 PathProgramCache]: Analyzing trace with hash -208740055, now seen corresponding path program 1 times [2025-03-17 06:02:53,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:53,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015877708] [2025-03-17 06:02:53,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:53,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:53,572 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:53,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-17 06:02:53,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 06:02:53,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 06:02:53,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:02:53,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:02:53,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 06:02:53,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:02:53,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:02:53,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 15 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 101 [2025-03-17 06:02:54,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:02:54,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 111 treesize of output 45 [2025-03-17 06:02:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:02:54,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:02:54,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:02:54,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015877708] [2025-03-17 06:02:54,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015877708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:02:54,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:02:54,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:02:54,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565259756] [2025-03-17 06:02:54,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:02:54,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:02:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:02:54,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:02:54,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:02:54,330 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:57,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:02:59,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:02:59,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:02:59,593 INFO L93 Difference]: Finished difference Result 351 states and 485 transitions. [2025-03-17 06:02:59,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:02:59,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-17 06:02:59,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:02:59,595 INFO L225 Difference]: With dead ends: 351 [2025-03-17 06:02:59,595 INFO L226 Difference]: Without dead ends: 228 [2025-03-17 06:02:59,596 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:02:59,596 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 98 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:02:59,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 418 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-17 06:02:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-17 06:02:59,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 194. [2025-03-17 06:02:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 162 states have (on average 1.3148148148148149) internal successors, (213), 162 states have internal predecessors, (213), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-17 06:02:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 269 transitions. [2025-03-17 06:02:59,607 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 269 transitions. Word has length 119 [2025-03-17 06:02:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:02:59,608 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 269 transitions. [2025-03-17 06:02:59,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:02:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 269 transitions. [2025-03-17 06:02:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-17 06:02:59,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:02:59,609 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:02:59,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-17 06:02:59,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:59,810 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:02:59,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:02:59,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1713761193, now seen corresponding path program 1 times [2025-03-17 06:02:59,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:02:59,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362140961] [2025-03-17 06:02:59,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:02:59,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:02:59,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:02:59,812 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:02:59,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-17 06:02:59,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-17 06:03:00,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-17 06:03:00,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:00,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:00,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 06:03:00,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:00,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 06:03:00,309 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-17 06:03:00,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:00,473 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 37 treesize of output 39 [2025-03-17 06:03:00,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:00,719 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 52 treesize of output 42 [2025-03-17 06:03:01,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:01,033 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 67 treesize of output 60 [2025-03-17 06:03:01,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 45 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 103 [2025-03-17 06:03:01,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:01,573 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 142 treesize of output 123 [2025-03-17 06:03:02,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:02,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 169 treesize of output 73 [2025-03-17 06:03:02,318 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 238 proven. 30 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-17 06:03:02,318 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:03:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-17 06:03:03,091 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:03,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362140961] [2025-03-17 06:03:03,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [362140961] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:03:03,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:03:03,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [21] total 29 [2025-03-17 06:03:03,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393175818] [2025-03-17 06:03:03,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:03,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:03:03,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:03,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:03:03,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2025-03-17 06:03:03,093 INFO L87 Difference]: Start difference. First operand 194 states and 269 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:03:12,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 06:03:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:16,820 INFO L93 Difference]: Finished difference Result 456 states and 623 transitions. [2025-03-17 06:03:16,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:03:16,825 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 119 [2025-03-17 06:03:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:16,827 INFO L225 Difference]: With dead ends: 456 [2025-03-17 06:03:16,827 INFO L226 Difference]: Without dead ends: 333 [2025-03-17 06:03:16,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 06:03:16,828 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 238 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:16,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1046 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2025-03-17 06:03:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-17 06:03:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 270. [2025-03-17 06:03:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 231 states have (on average 1.303030303030303) internal successors, (301), 232 states have internal predecessors, (301), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 06:03:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 369 transitions. [2025-03-17 06:03:16,841 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 369 transitions. Word has length 119 [2025-03-17 06:03:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:16,842 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 369 transitions. [2025-03-17 06:03:16,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-17 06:03:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 369 transitions. [2025-03-17 06:03:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:03:16,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:16,843 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:16,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-17 06:03:17,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:17,044 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:17,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash -818471561, now seen corresponding path program 1 times [2025-03-17 06:03:17,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:17,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017444124] [2025-03-17 06:03:17,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:17,045 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:17,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:17,047 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:03:17,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-17 06:03:17,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:03:17,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:03:17,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:17,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:17,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 06:03:17,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:17,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 06:03:17,706 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 80 treesize of output 34 [2025-03-17 06:03:17,847 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 80 treesize of output 34 [2025-03-17 06:03:17,996 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 75 treesize of output 44 [2025-03-17 06:03:18,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:18,230 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 90 treesize of output 47 [2025-03-17 06:03:18,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:18,454 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 90 treesize of output 47 [2025-03-17 06:03:18,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:18,666 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 90 treesize of output 47 [2025-03-17 06:03:18,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:18,971 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 90 treesize of output 47 [2025-03-17 06:03:19,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:19,056 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 151 treesize of output 124 [2025-03-17 06:03:20,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:20,123 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 182 treesize of output 139 [2025-03-17 06:03:24,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:24,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 324 treesize of output 120 [2025-03-17 06:03:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 224 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-17 06:03:24,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:24,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:24,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017444124] [2025-03-17 06:03:24,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017444124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:24,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:24,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:03:24,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368618157] [2025-03-17 06:03:24,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:24,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:03:24,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:24,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:03:24,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:03:24,429 INFO L87 Difference]: Start difference. First operand 270 states and 369 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 06:03:29,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:03:33,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:03:44,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:03:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:45,058 INFO L93 Difference]: Finished difference Result 549 states and 736 transitions. [2025-03-17 06:03:45,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 06:03:45,063 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2025-03-17 06:03:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:45,068 INFO L225 Difference]: With dead ends: 549 [2025-03-17 06:03:45,068 INFO L226 Difference]: Without dead ends: 547 [2025-03-17 06:03:45,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:03:45,069 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 232 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:45,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 576 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 18.1s Time] [2025-03-17 06:03:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-03-17 06:03:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 527. [2025-03-17 06:03:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 453 states have (on average 1.2891832229580573) internal successors, (584), 456 states have internal predecessors, (584), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 06:03:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 708 transitions. [2025-03-17 06:03:45,106 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 708 transitions. Word has length 121 [2025-03-17 06:03:45,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:45,106 INFO L471 AbstractCegarLoop]: Abstraction has 527 states and 708 transitions. [2025-03-17 06:03:45,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-17 06:03:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 708 transitions. [2025-03-17 06:03:45,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:03:45,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:45,107 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:45,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2025-03-17 06:03:45,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:45,312 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:45,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:45,313 INFO L85 PathProgramCache]: Analyzing trace with hash -817548040, now seen corresponding path program 1 times [2025-03-17 06:03:45,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:45,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680128326] [2025-03-17 06:03:45,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:45,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:45,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:45,315 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:03:45,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-17 06:03:45,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:03:45,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:03:45,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:45,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:45,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 06:03:45,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:45,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:03:45,618 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-17 06:03:45,685 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 25 treesize of output 24 [2025-03-17 06:03:45,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:45,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 27 [2025-03-17 06:03:45,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:45,875 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-17 06:03:46,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:46,044 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 50 treesize of output 40 [2025-03-17 06:03:46,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:46,081 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 81 treesize of output 90 [2025-03-17 06:03:46,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:46,182 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 99 treesize of output 113 [2025-03-17 06:03:47,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:47,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 140 treesize of output 56 [2025-03-17 06:03:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2025-03-17 06:03:47,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:03:47,239 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:03:47,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680128326] [2025-03-17 06:03:47,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680128326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:03:47,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:03:47,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 06:03:47,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366579355] [2025-03-17 06:03:47,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:03:47,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:03:47,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:03:47,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:03:47,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:03:47,240 INFO L87 Difference]: Start difference. First operand 527 states and 708 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 06:03:51,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:03:53,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:03:55,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:03:57,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:03:57,168 INFO L93 Difference]: Finished difference Result 1152 states and 1531 transitions. [2025-03-17 06:03:57,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 06:03:57,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 121 [2025-03-17 06:03:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:03:57,174 INFO L225 Difference]: With dead ends: 1152 [2025-03-17 06:03:57,174 INFO L226 Difference]: Without dead ends: 776 [2025-03-17 06:03:57,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-17 06:03:57,176 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 364 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2025-03-17 06:03:57,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 452 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2025-03-17 06:03:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2025-03-17 06:03:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 589. [2025-03-17 06:03:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 512 states have (on average 1.267578125) internal successors, (649), 515 states have internal predecessors, (649), 62 states have call successors, (62), 14 states have call predecessors, (62), 14 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 06:03:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 773 transitions. [2025-03-17 06:03:57,222 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 773 transitions. Word has length 121 [2025-03-17 06:03:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:03:57,222 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 773 transitions. [2025-03-17 06:03:57,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-17 06:03:57,223 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 773 transitions. [2025-03-17 06:03:57,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:03:57,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:03:57,225 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:03:57,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-17 06:03:57,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:57,426 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:03:57,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:03:57,426 INFO L85 PathProgramCache]: Analyzing trace with hash 69955641, now seen corresponding path program 1 times [2025-03-17 06:03:57,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:03:57,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445387737] [2025-03-17 06:03:57,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:03:57,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:03:57,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:03:57,429 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:03:57,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2025-03-17 06:03:57,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:03:57,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:03:57,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:03:57,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:03:57,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-17 06:03:57,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:03:57,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 06:03:58,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 80 treesize of output 34 [2025-03-17 06:03:58,357 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 75 treesize of output 44 [2025-03-17 06:03:58,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:58,675 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 90 treesize of output 47 [2025-03-17 06:03:58,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:58,902 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 85 treesize of output 57 [2025-03-17 06:03:59,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:59,256 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 95 treesize of output 70 [2025-03-17 06:03:59,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:59,748 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 110 treesize of output 73 [2025-03-17 06:03:59,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:03:59,877 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 179 treesize of output 110 [2025-03-17 06:04:00,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:04:00,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 165 treesize of output 116