./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.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 f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:09:08,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:09:08,799 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:09:08,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:09:08,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:09:08,829 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:09:08,829 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:09:08,829 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:09:08,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:09:08,830 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:09:08,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:09:08,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:09:08,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:09:08,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:09:08,830 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:09:08,830 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:09:08,831 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:09:08,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:09:08,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:09:08,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:09:08,832 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 -> f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc [2025-03-04 01:09:09,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:09:09,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:09:09,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:09:09,050 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:09:09,050 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:09:09,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2025-03-04 01:09:10,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd22eb53/7ab41ecbf03f47a182e7c1a7a0ad5360/FLAG5a7d708cf [2025-03-04 01:09:10,444 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:09:10,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2025-03-04 01:09:10,455 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd22eb53/7ab41ecbf03f47a182e7c1a7a0ad5360/FLAG5a7d708cf [2025-03-04 01:09:10,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6dd22eb53/7ab41ecbf03f47a182e7c1a7a0ad5360 [2025-03-04 01:09:10,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:09:10,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:09:10,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:09:10,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:09:10,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:09:10,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30296b30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10, skipping insertion in model container [2025-03-04 01:09:10,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:09:10,601 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-a_file-70.i[916,929] [2025-03-04 01:09:10,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:09:10,672 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:09:10,681 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-a_file-70.i[916,929] [2025-03-04 01:09:10,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:09:10,729 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:09:10,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10 WrapperNode [2025-03-04 01:09:10,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:09:10,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:09:10,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:09:10,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:09:10,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,781 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2025-03-04 01:09:10,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:09:10,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:09:10,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:09:10,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:09:10,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,806 INFO L175 MemorySlicer]: Split 132 memory accesses to 7 slices as follows [2, 8, 39, 12, 5, 41, 25]. 31 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 3, 1, 2, 2]. The 16 writes are split as follows [0, 1, 6, 3, 2, 2, 2]. [2025-03-04 01:09:10,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,828 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,829 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,844 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:09:10,845 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:09:10,845 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:09:10,845 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:09:10,846 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (1/1) ... [2025-03-04 01:09:10,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:09:10,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:10,876 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:09:10,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:09:10,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:09:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:09:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:09:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:09:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:09:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:09:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:09:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:09:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:09:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:09:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:09:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:09:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:09:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:09:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:09:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:09:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:09:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:09:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:09:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:09:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:09:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:09:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:09:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:09:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:09:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:09:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:09:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:09:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:09:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:09:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:09:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:09:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:09:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:09:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:09:11,025 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:09:11,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:09:11,409 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~mem88#1;havoc property_#t~ite95#1;havoc property_#t~mem94#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~ite92#1;havoc property_#t~mem91#1;havoc property_#t~mem93#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short100#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~short103#1;havoc property_#t~mem113#1;havoc property_#t~mem107#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~bitwise106#1;havoc property_#t~ite112#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~bitwise111#1;havoc property_#t~ite126#1;havoc property_#t~mem121#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~ite120#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite137#1;havoc property_#t~mem132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem133#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1;havoc property_#t~mem143#1;havoc property_#t~mem142#1;havoc property_#t~short144#1; [2025-03-04 01:09:11,448 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-03-04 01:09:11,448 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:09:11,462 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:09:11,462 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:09:11,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:09:11 BoogieIcfgContainer [2025-03-04 01:09:11,463 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:09:11,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:09:11,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:09:11,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:09:11,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:09:10" (1/3) ... [2025-03-04 01:09:11,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224ad943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:09:11, skipping insertion in model container [2025-03-04 01:09:11,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:09:10" (2/3) ... [2025-03-04 01:09:11,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@224ad943 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:09:11, skipping insertion in model container [2025-03-04 01:09:11,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:09:11" (3/3) ... [2025-03-04 01:09:11,470 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-70.i [2025-03-04 01:09:11,480 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:09:11,482 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-70.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:09:11,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:09:11,538 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;@78f66f9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:09:11,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:09:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 96 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:11,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:09:11,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:11,551 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:11,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:11,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash -581127195, now seen corresponding path program 1 times [2025-03-04 01:09:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:11,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038902466] [2025-03-04 01:09:11,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:11,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:11,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:11,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:11,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:11,826 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 01:09:11,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:11,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038902466] [2025-03-04 01:09:11,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038902466] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:11,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843967207] [2025-03-04 01:09:11,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:11,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:11,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:11,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:09:11,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:09:11,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:12,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:12,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:12,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:12,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:09:12,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 01:09:12,069 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:12,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843967207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:12,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:12,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:09:12,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492065772] [2025-03-04 01:09:12,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:12,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:09:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:12,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:09:12,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:09:12,093 INFO L87 Difference]: Start difference. First operand has 110 states, 95 states have (on average 1.431578947368421) internal successors, (136), 96 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:12,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:12,124 INFO L93 Difference]: Finished difference Result 214 states and 327 transitions. [2025-03-04 01:09:12,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:09:12,125 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-03-04 01:09:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:12,131 INFO L225 Difference]: With dead ends: 214 [2025-03-04 01:09:12,131 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 01:09:12,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:09:12,135 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:12,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 01:09:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 01:09:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 93 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2025-03-04 01:09:12,166 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 116 [2025-03-04 01:09:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:12,167 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2025-03-04 01:09:12,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2025-03-04 01:09:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:09:12,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:12,170 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:12,176 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-04 01:09:12,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:09:12,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:12,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:12,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1736818131, now seen corresponding path program 1 times [2025-03-04 01:09:12,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:12,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319771882] [2025-03-04 01:09:12,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:12,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:12,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:12,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:12,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:12,774 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:09:12,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319771882] [2025-03-04 01:09:12,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319771882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:12,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923407527] [2025-03-04 01:09:12,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:12,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:12,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:12,776 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:09:12,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:09:12,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:12,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:12,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:12,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:12,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:09:12,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:12,990 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:12,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923407527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:12,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:12,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:09:12,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141334081] [2025-03-04 01:09:12,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:12,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:09:12,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:12,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:09:12,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:12,994 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:13,033 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2025-03-04 01:09:13,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:09:13,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-04 01:09:13,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:13,038 INFO L225 Difference]: With dead ends: 214 [2025-03-04 01:09:13,038 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 01:09:13,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 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-04 01:09:13,039 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:13,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:13,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 01:09:13,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-04 01:09:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2025-03-04 01:09:13,049 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 116 [2025-03-04 01:09:13,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:13,050 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2025-03-04 01:09:13,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:13,050 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2025-03-04 01:09:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:09:13,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:13,051 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:13,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:09:13,253 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-04 01:09:13,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:13,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash -849314450, now seen corresponding path program 1 times [2025-03-04 01:09:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:13,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814967973] [2025-03-04 01:09:13,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:13,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:13,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:13,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:13,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:13,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:09:13,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:13,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814967973] [2025-03-04 01:09:13,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814967973] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:13,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936733581] [2025-03-04 01:09:13,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:13,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:13,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:13,482 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-04 01:09:13,484 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-04 01:09:13,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:13,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:13,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:13,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:13,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:09:13,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:13,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:13,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936733581] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:13,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:13,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-04 01:09:13,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59391773] [2025-03-04 01:09:13,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:13,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:09:13,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:13,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:09:13,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:13,699 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:13,742 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2025-03-04 01:09:13,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:09:13,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-04 01:09:13,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:13,745 INFO L225 Difference]: With dead ends: 218 [2025-03-04 01:09:13,746 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 01:09:13,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 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-04 01:09:13,748 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:13,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:13,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 01:09:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-03-04 01:09:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2025-03-04 01:09:13,760 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 116 [2025-03-04 01:09:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:13,760 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2025-03-04 01:09:13,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2025-03-04 01:09:13,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:09:13,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:13,762 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:13,769 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 01:09:13,965 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-04 01:09:13,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:13,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:13,965 INFO L85 PathProgramCache]: Analyzing trace with hash -848390929, now seen corresponding path program 1 times [2025-03-04 01:09:13,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:13,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125499959] [2025-03-04 01:09:13,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:13,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:13,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:13,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:13,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:13,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:09:14,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:14,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125499959] [2025-03-04 01:09:14,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125499959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:14,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179957037] [2025-03-04 01:09:14,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:14,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:14,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:14,122 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-04 01:09:14,123 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-04 01:09:14,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:09:14,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:09:14,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:14,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:14,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:09:14,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:14,305 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179957037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:14,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:14,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:09:14,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669253440] [2025-03-04 01:09:14,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:14,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:09:14,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:14,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:09:14,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:14,307 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:14,336 INFO L93 Difference]: Finished difference Result 221 states and 318 transitions. [2025-03-04 01:09:14,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:09:14,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2025-03-04 01:09:14,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:14,339 INFO L225 Difference]: With dead ends: 221 [2025-03-04 01:09:14,339 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 01:09:14,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 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-04 01:09:14,341 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:14,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 436 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:14,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 01:09:14,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-03-04 01:09:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:14,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-03-04 01:09:14,349 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 116 [2025-03-04 01:09:14,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:14,349 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-03-04 01:09:14,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:14,349 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-03-04 01:09:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:09:14,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:14,352 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:14,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:09:14,553 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-04 01:09:14,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:14,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:14,554 INFO L85 PathProgramCache]: Analyzing trace with hash 539227629, now seen corresponding path program 1 times [2025-03-04 01:09:14,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:14,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856270432] [2025-03-04 01:09:14,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:14,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:14,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:09:14,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:09:14,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:14,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:15,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:15,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856270432] [2025-03-04 01:09:15,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856270432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:15,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:15,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:15,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330104753] [2025-03-04 01:09:15,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:15,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:15,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:15,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:15,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:15,028 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:15,096 INFO L93 Difference]: Finished difference Result 282 states and 402 transitions. [2025-03-04 01:09:15,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:09:15,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-03-04 01:09:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:15,097 INFO L225 Difference]: With dead ends: 282 [2025-03-04 01:09:15,097 INFO L226 Difference]: Without dead ends: 172 [2025-03-04 01:09:15,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:15,098 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 149 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:15,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 558 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:15,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-03-04 01:09:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2025-03-04 01:09:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2025-03-04 01:09:15,108 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 118 [2025-03-04 01:09:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:15,108 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2025-03-04 01:09:15,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:15,109 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2025-03-04 01:09:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:09:15,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:15,109 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:15,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:09:15,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1506961907, now seen corresponding path program 1 times [2025-03-04 01:09:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843551615] [2025-03-04 01:09:15,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:15,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:15,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:09:15,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:09:15,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:15,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:15,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:15,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843551615] [2025-03-04 01:09:15,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843551615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:15,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:15,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:09:15,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834087714] [2025-03-04 01:09:15,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:15,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:09:15,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:15,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:09:15,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:09:15,256 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:15,281 INFO L93 Difference]: Finished difference Result 229 states and 325 transitions. [2025-03-04 01:09:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:09:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-04 01:09:15,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:15,283 INFO L225 Difference]: With dead ends: 229 [2025-03-04 01:09:15,283 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:09:15,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:09:15,284 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:15,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 431 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:09:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2025-03-04 01:09:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2025-03-04 01:09:15,294 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 118 [2025-03-04 01:09:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:15,294 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2025-03-04 01:09:15,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2025-03-04 01:09:15,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 01:09:15,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:15,297 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:15,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:09:15,298 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:15,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash -947834232, now seen corresponding path program 1 times [2025-03-04 01:09:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:15,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61996956] [2025-03-04 01:09:15,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:15,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 01:09:15,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 01:09:15,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:15,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:15,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:15,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61996956] [2025-03-04 01:09:15,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61996956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:15,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:15,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:15,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879230955] [2025-03-04 01:09:15,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:15,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:15,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:15,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:15,679 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:15,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:15,738 INFO L93 Difference]: Finished difference Result 281 states and 393 transitions. [2025-03-04 01:09:15,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:15,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-04 01:09:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:15,740 INFO L225 Difference]: With dead ends: 281 [2025-03-04 01:09:15,740 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 01:09:15,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:15,741 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 114 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:15,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 557 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:15,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 01:09:15,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2025-03-04 01:09:15,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 117 states have (on average 1.358974358974359) internal successors, (159), 117 states have internal predecessors, (159), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:15,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 183 transitions. [2025-03-04 01:09:15,749 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 183 transitions. Word has length 120 [2025-03-04 01:09:15,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:15,749 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 183 transitions. [2025-03-04 01:09:15,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 183 transitions. [2025-03-04 01:09:15,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:09:15,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:15,750 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:15,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:09:15,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:15,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:15,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2034717190, now seen corresponding path program 1 times [2025-03-04 01:09:15,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:15,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235496676] [2025-03-04 01:09:15,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:15,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:15,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:09:15,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:09:15,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:15,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:16,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235496676] [2025-03-04 01:09:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235496676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:16,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:16,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:16,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895630692] [2025-03-04 01:09:16,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:16,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:16,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:16,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:16,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:16,060 INFO L87 Difference]: Start difference. First operand 131 states and 183 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:16,122 INFO L93 Difference]: Finished difference Result 297 states and 414 transitions. [2025-03-04 01:09:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:09:16,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-04 01:09:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:16,123 INFO L225 Difference]: With dead ends: 297 [2025-03-04 01:09:16,123 INFO L226 Difference]: Without dead ends: 169 [2025-03-04 01:09:16,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:16,124 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 53 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:16,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 690 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-04 01:09:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2025-03-04 01:09:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.3471074380165289) internal successors, (163), 121 states have internal predecessors, (163), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 187 transitions. [2025-03-04 01:09:16,128 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 187 transitions. Word has length 121 [2025-03-04 01:09:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:16,128 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 187 transitions. [2025-03-04 01:09:16,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 187 transitions. [2025-03-04 01:09:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:09:16,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:16,129 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:16,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:09:16,129 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:16,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:16,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1032724006, now seen corresponding path program 1 times [2025-03-04 01:09:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:16,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504986242] [2025-03-04 01:09:16,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:16,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:16,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:09:16,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:09:16,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:16,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:09:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504986242] [2025-03-04 01:09:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504986242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:09:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644142359] [2025-03-04 01:09:16,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:16,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:16,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:09:16,283 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-04 01:09:16,285 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-04 01:09:16,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:09:16,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:09:16,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:16,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:16,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:09:16,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:09:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:16,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:09:16,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644142359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:16,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:09:16,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-04 01:09:16,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230337535] [2025-03-04 01:09:16,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:16,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:09:16,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:16,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:09:16,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:16,476 INFO L87 Difference]: Start difference. First operand 135 states and 187 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:16,509 INFO L93 Difference]: Finished difference Result 270 states and 375 transitions. [2025-03-04 01:09:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:09:16,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2025-03-04 01:09:16,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:16,511 INFO L225 Difference]: With dead ends: 270 [2025-03-04 01:09:16,511 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:09:16,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:16,512 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:16,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 571 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:09:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 01:09:16,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 190 transitions. [2025-03-04 01:09:16,518 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 190 transitions. Word has length 121 [2025-03-04 01:09:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:16,519 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 190 transitions. [2025-03-04 01:09:16,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:16,519 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 190 transitions. [2025-03-04 01:09:16,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:09:16,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:16,520 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:16,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 01:09:16,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:09:16,720 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:16,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1803489974, now seen corresponding path program 1 times [2025-03-04 01:09:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:16,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994419165] [2025-03-04 01:09:16,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:16,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:16,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:09:16,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:09:16,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:16,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:17,663 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:17,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:17,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994419165] [2025-03-04 01:09:17,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994419165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:17,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:17,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:09:17,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523084310] [2025-03-04 01:09:17,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:17,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:09:17,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:17,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:09:17,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:09:17,665 INFO L87 Difference]: Start difference. First operand 138 states and 190 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:18,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:18,285 INFO L93 Difference]: Finished difference Result 494 states and 686 transitions. [2025-03-04 01:09:18,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:09:18,286 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2025-03-04 01:09:18,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:18,288 INFO L225 Difference]: With dead ends: 494 [2025-03-04 01:09:18,288 INFO L226 Difference]: Without dead ends: 359 [2025-03-04 01:09:18,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:09:18,289 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 273 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 1742 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:18,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 1742 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:09:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-04 01:09:18,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 158. [2025-03-04 01:09:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 144 states have (on average 1.3541666666666667) internal successors, (195), 144 states have internal predecessors, (195), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:09:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 219 transitions. [2025-03-04 01:09:18,296 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 219 transitions. Word has length 122 [2025-03-04 01:09:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:18,296 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 219 transitions. [2025-03-04 01:09:18,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 219 transitions. [2025-03-04 01:09:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:09:18,297 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:18,298 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:18,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:09:18,298 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:18,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:18,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1980943145, now seen corresponding path program 1 times [2025-03-04 01:09:18,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:18,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598029180] [2025-03-04 01:09:18,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:18,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:18,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:09:18,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:09:18,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:18,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:19,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:19,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598029180] [2025-03-04 01:09:19,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598029180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:19,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:19,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:09:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890611276] [2025-03-04 01:09:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:19,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:09:19,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:19,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:09:19,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:09:19,009 INFO L87 Difference]: Start difference. First operand 158 states and 219 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:19,741 INFO L93 Difference]: Finished difference Result 535 states and 746 transitions. [2025-03-04 01:09:19,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:09:19,741 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-04 01:09:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:19,743 INFO L225 Difference]: With dead ends: 535 [2025-03-04 01:09:19,743 INFO L226 Difference]: Without dead ends: 380 [2025-03-04 01:09:19,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:09:19,744 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 499 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:19,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 2173 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:09:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-04 01:09:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 271. [2025-03-04 01:09:19,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 246 states have (on average 1.3577235772357723) internal successors, (334), 247 states have internal predecessors, (334), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:09:19,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 378 transitions. [2025-03-04 01:09:19,756 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 378 transitions. Word has length 122 [2025-03-04 01:09:19,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:19,756 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 378 transitions. [2025-03-04 01:09:19,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 12 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:19,757 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 378 transitions. [2025-03-04 01:09:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:09:19,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:19,757 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:19,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:09:19,758 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:19,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:19,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1352410134, now seen corresponding path program 1 times [2025-03-04 01:09:19,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:19,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395583068] [2025-03-04 01:09:19,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:19,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:19,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:09:19,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:09:19,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:19,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:20,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:20,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395583068] [2025-03-04 01:09:20,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395583068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:20,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:20,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:09:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745897957] [2025-03-04 01:09:20,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:20,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:09:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:20,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:09:20,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:20,094 INFO L87 Difference]: Start difference. First operand 271 states and 378 transitions. Second operand has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:20,294 INFO L93 Difference]: Finished difference Result 640 states and 894 transitions. [2025-03-04 01:09:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:09:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2025-03-04 01:09:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:20,297 INFO L225 Difference]: With dead ends: 640 [2025-03-04 01:09:20,297 INFO L226 Difference]: Without dead ends: 372 [2025-03-04 01:09:20,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:20,298 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 125 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:20,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1302 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2025-03-04 01:09:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 256. [2025-03-04 01:09:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 231 states have (on average 1.3506493506493507) internal successors, (312), 232 states have internal predecessors, (312), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:09:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 356 transitions. [2025-03-04 01:09:20,314 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 356 transitions. Word has length 122 [2025-03-04 01:09:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:20,314 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 356 transitions. [2025-03-04 01:09:20,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 13.0) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 356 transitions. [2025-03-04 01:09:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:09:20,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:20,315 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:20,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:09:20,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:20,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:20,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1452690037, now seen corresponding path program 1 times [2025-03-04 01:09:20,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:20,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145473842] [2025-03-04 01:09:20,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:20,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:20,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:09:20,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:09:20,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:20,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:20,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145473842] [2025-03-04 01:09:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145473842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:20,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:20,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:20,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604333824] [2025-03-04 01:09:20,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:20,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:20,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:20,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:20,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:20,586 INFO L87 Difference]: Start difference. First operand 256 states and 356 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:20,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:20,734 INFO L93 Difference]: Finished difference Result 587 states and 817 transitions. [2025-03-04 01:09:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:20,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-04 01:09:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:20,737 INFO L225 Difference]: With dead ends: 587 [2025-03-04 01:09:20,737 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 01:09:20,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:20,738 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 127 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:20,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 764 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:09:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 01:09:20,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 246. [2025-03-04 01:09:20,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 221 states have (on average 1.3438914027149322) internal successors, (297), 222 states have internal predecessors, (297), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:09:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 341 transitions. [2025-03-04 01:09:20,752 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 341 transitions. Word has length 122 [2025-03-04 01:09:20,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:20,752 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 341 transitions. [2025-03-04 01:09:20,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 341 transitions. [2025-03-04 01:09:20,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:09:20,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:20,753 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:20,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:09:20,754 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:20,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:20,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1963224214, now seen corresponding path program 1 times [2025-03-04 01:09:20,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:20,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846908359] [2025-03-04 01:09:20,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:20,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:20,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:09:20,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:09:20,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:20,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:21,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:21,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846908359] [2025-03-04 01:09:21,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846908359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:21,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:21,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:09:21,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534111279] [2025-03-04 01:09:21,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:21,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:09:21,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:21,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:09:21,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:21,310 INFO L87 Difference]: Start difference. First operand 246 states and 341 transitions. Second operand has 8 states, 6 states have (on average 10.833333333333334) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:21,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:21,653 INFO L93 Difference]: Finished difference Result 577 states and 801 transitions. [2025-03-04 01:09:21,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:09:21,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.833333333333334) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2025-03-04 01:09:21,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:21,655 INFO L225 Difference]: With dead ends: 577 [2025-03-04 01:09:21,655 INFO L226 Difference]: Without dead ends: 334 [2025-03-04 01:09:21,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:09:21,656 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 133 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:21,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1312 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-04 01:09:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 245. [2025-03-04 01:09:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 220 states have (on average 1.3409090909090908) internal successors, (295), 221 states have internal predecessors, (295), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:09:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 339 transitions. [2025-03-04 01:09:21,673 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 339 transitions. Word has length 122 [2025-03-04 01:09:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:21,673 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 339 transitions. [2025-03-04 01:09:21,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.833333333333334) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 339 transitions. [2025-03-04 01:09:21,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 01:09:21,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:21,675 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:21,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:09:21,675 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:21,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1001610197, now seen corresponding path program 1 times [2025-03-04 01:09:21,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:21,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429201624] [2025-03-04 01:09:21,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:21,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 01:09:21,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 01:09:21,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:21,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:22,855 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:22,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429201624] [2025-03-04 01:09:22,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429201624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:22,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:22,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:09:22,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786077143] [2025-03-04 01:09:22,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:22,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:09:22,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:22,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:09:22,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:09:22,857 INFO L87 Difference]: Start difference. First operand 245 states and 339 transitions. Second operand has 15 states, 13 states have (on average 5.0) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:25,080 INFO L93 Difference]: Finished difference Result 720 states and 1001 transitions. [2025-03-04 01:09:25,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 01:09:25,084 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.0) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2025-03-04 01:09:25,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:25,086 INFO L225 Difference]: With dead ends: 720 [2025-03-04 01:09:25,086 INFO L226 Difference]: Without dead ends: 478 [2025-03-04 01:09:25,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:09:25,090 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 413 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:25,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 2406 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 01:09:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-04 01:09:25,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 254. [2025-03-04 01:09:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 229 states have (on average 1.3449781659388647) internal successors, (308), 230 states have internal predecessors, (308), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:09:25,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 352 transitions. [2025-03-04 01:09:25,111 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 352 transitions. Word has length 122 [2025-03-04 01:09:25,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:25,112 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 352 transitions. [2025-03-04 01:09:25,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.0) internal successors, (65), 15 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 352 transitions. [2025-03-04 01:09:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:09:25,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:25,114 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:25,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:09:25,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:25,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:25,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1294008898, now seen corresponding path program 1 times [2025-03-04 01:09:25,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:25,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267087278] [2025-03-04 01:09:25,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:25,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:25,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:09:25,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:09:25,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:25,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:25,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:25,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267087278] [2025-03-04 01:09:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267087278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:25,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:25,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:09:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915141139] [2025-03-04 01:09:25,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:25,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:09:25,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:25,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:09:25,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:25,407 INFO L87 Difference]: Start difference. First operand 254 states and 352 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:25,629 INFO L93 Difference]: Finished difference Result 699 states and 971 transitions. [2025-03-04 01:09:25,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:09:25,630 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-03-04 01:09:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:25,632 INFO L225 Difference]: With dead ends: 699 [2025-03-04 01:09:25,632 INFO L226 Difference]: Without dead ends: 448 [2025-03-04 01:09:25,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:25,634 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 137 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:25,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 855 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-04 01:09:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 258. [2025-03-04 01:09:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 233 states have (on average 1.3347639484978542) internal successors, (311), 234 states have internal predecessors, (311), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:09:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 355 transitions. [2025-03-04 01:09:25,656 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 355 transitions. Word has length 123 [2025-03-04 01:09:25,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:25,657 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 355 transitions. [2025-03-04 01:09:25,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 355 transitions. [2025-03-04 01:09:25,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:09:25,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:25,658 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:25,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:09:25,658 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:25,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:25,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1504725880, now seen corresponding path program 1 times [2025-03-04 01:09:25,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:25,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078965278] [2025-03-04 01:09:25,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:25,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:25,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:09:25,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:09:25,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:25,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:25,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078965278] [2025-03-04 01:09:25,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078965278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:25,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:25,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443115959] [2025-03-04 01:09:25,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:25,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:25,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:25,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:25,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:25,821 INFO L87 Difference]: Start difference. First operand 258 states and 355 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:25,928 INFO L93 Difference]: Finished difference Result 770 states and 1062 transitions. [2025-03-04 01:09:25,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:09:25,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-03-04 01:09:25,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:25,930 INFO L225 Difference]: With dead ends: 770 [2025-03-04 01:09:25,930 INFO L226 Difference]: Without dead ends: 515 [2025-03-04 01:09:25,931 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-04 01:09:25,931 INFO L435 NwaCegarLoop]: 280 mSDtfsCounter, 137 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:25,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1228 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:09:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-04 01:09:25,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 510. [2025-03-04 01:09:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 461 states have (on average 1.3383947939262473) internal successors, (617), 463 states have internal predecessors, (617), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:09:25,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 705 transitions. [2025-03-04 01:09:25,969 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 705 transitions. Word has length 123 [2025-03-04 01:09:25,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:25,969 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 705 transitions. [2025-03-04 01:09:25,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:25,969 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 705 transitions. [2025-03-04 01:09:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:09:25,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:25,971 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:25,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:09:25,971 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:25,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:25,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1249989335, now seen corresponding path program 1 times [2025-03-04 01:09:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:25,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330335331] [2025-03-04 01:09:25,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:25,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:25,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:09:26,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:09:26,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:26,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:26,156 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:26,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:26,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330335331] [2025-03-04 01:09:26,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330335331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:26,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:26,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:26,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829888408] [2025-03-04 01:09:26,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:26,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:26,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:26,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:26,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:26,158 INFO L87 Difference]: Start difference. First operand 510 states and 705 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:26,244 INFO L93 Difference]: Finished difference Result 1021 states and 1410 transitions. [2025-03-04 01:09:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:26,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-03-04 01:09:26,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:26,246 INFO L225 Difference]: With dead ends: 1021 [2025-03-04 01:09:26,246 INFO L226 Difference]: Without dead ends: 514 [2025-03-04 01:09:26,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:26,248 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 62 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:26,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 839 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:26,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-03-04 01:09:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 510. [2025-03-04 01:09:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 461 states have (on average 1.3210412147505424) internal successors, (609), 463 states have internal predecessors, (609), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:09:26,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 697 transitions. [2025-03-04 01:09:26,294 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 697 transitions. Word has length 123 [2025-03-04 01:09:26,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:26,294 INFO L471 AbstractCegarLoop]: Abstraction has 510 states and 697 transitions. [2025-03-04 01:09:26,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 6 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:26,294 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 697 transitions. [2025-03-04 01:09:26,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:09:26,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:26,295 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:26,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:09:26,296 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:26,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:26,296 INFO L85 PathProgramCache]: Analyzing trace with hash -180198170, now seen corresponding path program 1 times [2025-03-04 01:09:26,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980863401] [2025-03-04 01:09:26,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:26,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:26,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:09:26,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:09:26,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:26,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:26,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:26,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980863401] [2025-03-04 01:09:26,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980863401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:26,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:26,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:26,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186808881] [2025-03-04 01:09:26,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:26,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:26,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:26,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:26,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:26,581 INFO L87 Difference]: Start difference. First operand 510 states and 697 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:26,704 INFO L93 Difference]: Finished difference Result 1019 states and 1395 transitions. [2025-03-04 01:09:26,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:26,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2025-03-04 01:09:26,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:26,707 INFO L225 Difference]: With dead ends: 1019 [2025-03-04 01:09:26,707 INFO L226 Difference]: Without dead ends: 512 [2025-03-04 01:09:26,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:26,708 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 3 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:26,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 628 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:09:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-04 01:09:26,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 508. [2025-03-04 01:09:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 459 states have (on average 1.3093681917211328) internal successors, (601), 461 states have internal predecessors, (601), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-04 01:09:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 689 transitions. [2025-03-04 01:09:26,754 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 689 transitions. Word has length 123 [2025-03-04 01:09:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:26,754 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 689 transitions. [2025-03-04 01:09:26,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 689 transitions. [2025-03-04 01:09:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:09:26,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:26,755 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:26,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:09:26,755 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:26,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:26,756 INFO L85 PathProgramCache]: Analyzing trace with hash -166606383, now seen corresponding path program 1 times [2025-03-04 01:09:26,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:26,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907162707] [2025-03-04 01:09:26,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:26,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:26,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:09:26,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:09:26,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:26,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:27,449 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:27,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:27,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907162707] [2025-03-04 01:09:27,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907162707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:27,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:27,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:09:27,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404534006] [2025-03-04 01:09:27,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:27,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:09:27,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:27,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:09:27,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:09:27,451 INFO L87 Difference]: Start difference. First operand 508 states and 689 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:27,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:27,946 INFO L93 Difference]: Finished difference Result 1204 states and 1636 transitions. [2025-03-04 01:09:27,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:09:27,946 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-03-04 01:09:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:27,949 INFO L225 Difference]: With dead ends: 1204 [2025-03-04 01:09:27,950 INFO L226 Difference]: Without dead ends: 699 [2025-03-04 01:09:27,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:09:27,951 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 127 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:27,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1858 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:27,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-04 01:09:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 669. [2025-03-04 01:09:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 592 states have (on average 1.3125) internal successors, (777), 596 states have internal predecessors, (777), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:09:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 913 transitions. [2025-03-04 01:09:28,039 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 913 transitions. Word has length 124 [2025-03-04 01:09:28,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:28,040 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 913 transitions. [2025-03-04 01:09:28,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 913 transitions. [2025-03-04 01:09:28,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 01:09:28,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:28,042 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:28,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:09:28,042 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:28,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:28,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2127251506, now seen corresponding path program 1 times [2025-03-04 01:09:28,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:28,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273732121] [2025-03-04 01:09:28,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:28,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:28,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 01:09:28,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 01:09:28,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:28,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:35,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:35,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273732121] [2025-03-04 01:09:35,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273732121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:35,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:35,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:09:35,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441456246] [2025-03-04 01:09:35,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:35,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:09:35,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:35,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:09:35,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:09:35,030 INFO L87 Difference]: Start difference. First operand 669 states and 913 transitions. Second operand has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:41,949 INFO L93 Difference]: Finished difference Result 1382 states and 1889 transitions. [2025-03-04 01:09:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:09:41,950 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 124 [2025-03-04 01:09:41,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:41,954 INFO L225 Difference]: With dead ends: 1382 [2025-03-04 01:09:41,954 INFO L226 Difference]: Without dead ends: 716 [2025-03-04 01:09:41,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:09:41,956 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 120 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:41,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 2191 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-03-04 01:09:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-04 01:09:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 643. [2025-03-04 01:09:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 566 states have (on average 1.3109540636042403) internal successors, (742), 570 states have internal predecessors, (742), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:09:42,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 878 transitions. [2025-03-04 01:09:42,071 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 878 transitions. Word has length 124 [2025-03-04 01:09:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:42,071 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 878 transitions. [2025-03-04 01:09:42,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.090909090909091) internal successors, (67), 13 states have internal predecessors, (67), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 878 transitions. [2025-03-04 01:09:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:09:42,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:42,074 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:42,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:09:42,074 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:42,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:42,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1928530073, now seen corresponding path program 1 times [2025-03-04 01:09:42,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:42,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110421860] [2025-03-04 01:09:42,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:42,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:09:42,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:09:42,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:42,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:43,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:43,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110421860] [2025-03-04 01:09:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110421860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:43,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:43,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:09:43,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676064196] [2025-03-04 01:09:43,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:43,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:09:43,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:43,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:09:43,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:09:43,161 INFO L87 Difference]: Start difference. First operand 643 states and 878 transitions. Second operand has 15 states, 13 states have (on average 5.230769230769231) internal successors, (68), 15 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:48,870 INFO L93 Difference]: Finished difference Result 1665 states and 2278 transitions. [2025-03-04 01:09:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 01:09:48,875 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.230769230769231) internal successors, (68), 15 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2025-03-04 01:09:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:48,879 INFO L225 Difference]: With dead ends: 1665 [2025-03-04 01:09:48,879 INFO L226 Difference]: Without dead ends: 1025 [2025-03-04 01:09:48,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:09:48,882 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 513 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 3189 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:48,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 3189 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-04 01:09:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2025-03-04 01:09:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 685. [2025-03-04 01:09:48,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 608 states have (on average 1.305921052631579) internal successors, (794), 612 states have internal predecessors, (794), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:09:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 930 transitions. [2025-03-04 01:09:48,976 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 930 transitions. Word has length 125 [2025-03-04 01:09:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:48,976 INFO L471 AbstractCegarLoop]: Abstraction has 685 states and 930 transitions. [2025-03-04 01:09:48,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.230769230769231) internal successors, (68), 15 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 930 transitions. [2025-03-04 01:09:48,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:09:48,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:48,978 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:48,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:09:48,979 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:48,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:48,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2015637286, now seen corresponding path program 1 times [2025-03-04 01:09:48,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:48,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740018893] [2025-03-04 01:09:48,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:48,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:48,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:09:49,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:09:49,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:49,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:49,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:49,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740018893] [2025-03-04 01:09:49,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740018893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:49,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:49,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:49,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003429023] [2025-03-04 01:09:49,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:49,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:49,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:49,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:49,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:49,152 INFO L87 Difference]: Start difference. First operand 685 states and 930 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:49,277 INFO L93 Difference]: Finished difference Result 1344 states and 1826 transitions. [2025-03-04 01:09:49,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:49,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-03-04 01:09:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:49,280 INFO L225 Difference]: With dead ends: 1344 [2025-03-04 01:09:49,280 INFO L226 Difference]: Without dead ends: 662 [2025-03-04 01:09:49,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:49,282 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 71 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:49,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 828 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:09:49,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-04 01:09:49,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 658. [2025-03-04 01:09:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 585 states have internal predecessors, (756), 68 states have call successors, (68), 8 states have call predecessors, (68), 8 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:09:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 892 transitions. [2025-03-04 01:09:49,369 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 892 transitions. Word has length 125 [2025-03-04 01:09:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:49,369 INFO L471 AbstractCegarLoop]: Abstraction has 658 states and 892 transitions. [2025-03-04 01:09:49,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 892 transitions. [2025-03-04 01:09:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:09:49,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:49,371 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:49,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:09:49,371 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:49,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:49,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2109550201, now seen corresponding path program 1 times [2025-03-04 01:09:49,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:49,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876388605] [2025-03-04 01:09:49,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:49,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:49,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:09:49,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:09:49,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:49,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:50,171 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:50,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:50,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876388605] [2025-03-04 01:09:50,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876388605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:50,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:50,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:09:50,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975840886] [2025-03-04 01:09:50,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:50,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:09:50,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:50,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:09:50,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:09:50,173 INFO L87 Difference]: Start difference. First operand 658 states and 892 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:50,949 INFO L93 Difference]: Finished difference Result 1361 states and 1848 transitions. [2025-03-04 01:09:50,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:09:50,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2025-03-04 01:09:50,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:50,952 INFO L225 Difference]: With dead ends: 1361 [2025-03-04 01:09:50,952 INFO L226 Difference]: Without dead ends: 706 [2025-03-04 01:09:50,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:09:50,953 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 400 mSDsluCounter, 1701 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1944 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:50,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1944 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:09:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2025-03-04 01:09:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 340. [2025-03-04 01:09:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 301 states have (on average 1.2956810631229236) internal successors, (390), 303 states have internal predecessors, (390), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:09:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 458 transitions. [2025-03-04 01:09:50,988 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 458 transitions. Word has length 125 [2025-03-04 01:09:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:50,989 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 458 transitions. [2025-03-04 01:09:50,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 458 transitions. [2025-03-04 01:09:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:09:50,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:50,990 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:50,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:09:50,990 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:50,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash -100315827, now seen corresponding path program 1 times [2025-03-04 01:09:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:50,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134807275] [2025-03-04 01:09:50,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:51,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:09:51,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:09:51,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:51,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134807275] [2025-03-04 01:09:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134807275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:09:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109810507] [2025-03-04 01:09:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:51,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:09:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:51,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:09:51,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:09:51,233 INFO L87 Difference]: Start difference. First operand 340 states and 458 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:51,474 INFO L93 Difference]: Finished difference Result 969 states and 1316 transitions. [2025-03-04 01:09:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:09:51,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-03-04 01:09:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:51,477 INFO L225 Difference]: With dead ends: 969 [2025-03-04 01:09:51,477 INFO L226 Difference]: Without dead ends: 632 [2025-03-04 01:09:51,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:09:51,478 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 118 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:51,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1266 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:51,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-04 01:09:51,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 412. [2025-03-04 01:09:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 373 states have (on average 1.289544235924933) internal successors, (481), 375 states have internal predecessors, (481), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:09:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 549 transitions. [2025-03-04 01:09:51,514 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 549 transitions. Word has length 125 [2025-03-04 01:09:51,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:51,515 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 549 transitions. [2025-03-04 01:09:51,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 549 transitions. [2025-03-04 01:09:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:09:51,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:51,516 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:51,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:09:51,516 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:51,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash -730999642, now seen corresponding path program 1 times [2025-03-04 01:09:51,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:51,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341751961] [2025-03-04 01:09:51,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:51,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:51,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:09:51,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:09:51,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:51,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:51,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:51,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341751961] [2025-03-04 01:09:51,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341751961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:51,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:51,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:09:51,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165986514] [2025-03-04 01:09:51,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:51,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:09:51,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:51,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:09:51,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:51,828 INFO L87 Difference]: Start difference. First operand 412 states and 549 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:52,101 INFO L93 Difference]: Finished difference Result 1041 states and 1404 transitions. [2025-03-04 01:09:52,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:09:52,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2025-03-04 01:09:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:52,105 INFO L225 Difference]: With dead ends: 1041 [2025-03-04 01:09:52,105 INFO L226 Difference]: Without dead ends: 632 [2025-03-04 01:09:52,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:52,106 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 117 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:52,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 734 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-04 01:09:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 412. [2025-03-04 01:09:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 373 states have (on average 1.2815013404825737) internal successors, (478), 375 states have internal predecessors, (478), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:09:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 546 transitions. [2025-03-04 01:09:52,171 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 546 transitions. Word has length 127 [2025-03-04 01:09:52,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:52,172 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 546 transitions. [2025-03-04 01:09:52,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 546 transitions. [2025-03-04 01:09:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:09:52,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:52,175 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:52,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:09:52,175 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:52,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash 993937074, now seen corresponding path program 1 times [2025-03-04 01:09:52,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:52,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061020082] [2025-03-04 01:09:52,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:52,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:52,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:09:52,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:09:52,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:52,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:52,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:52,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061020082] [2025-03-04 01:09:52,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061020082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:52,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:52,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:09:52,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943476949] [2025-03-04 01:09:52,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:52,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:09:52,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:52,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:09:52,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:09:52,934 INFO L87 Difference]: Start difference. First operand 412 states and 546 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:53,575 INFO L93 Difference]: Finished difference Result 1157 states and 1548 transitions. [2025-03-04 01:09:53,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:09:53,576 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 127 [2025-03-04 01:09:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:53,578 INFO L225 Difference]: With dead ends: 1157 [2025-03-04 01:09:53,578 INFO L226 Difference]: Without dead ends: 748 [2025-03-04 01:09:53,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:09:53,579 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 306 mSDsluCounter, 1784 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:53,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 2058 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:09:53,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-04 01:09:53,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 619. [2025-03-04 01:09:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 556 states have (on average 1.2823741007194245) internal successors, (713), 559 states have internal predecessors, (713), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:09:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 825 transitions. [2025-03-04 01:09:53,646 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 825 transitions. Word has length 127 [2025-03-04 01:09:53,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:53,647 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 825 transitions. [2025-03-04 01:09:53,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 12 states have internal predecessors, (70), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 825 transitions. [2025-03-04 01:09:53,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 01:09:53,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:53,647 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:53,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:09:53,648 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:53,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1307103532, now seen corresponding path program 1 times [2025-03-04 01:09:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:53,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316571956] [2025-03-04 01:09:53,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:53,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:53,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 01:09:53,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 01:09:53,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:53,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:53,814 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:53,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:53,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316571956] [2025-03-04 01:09:53,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316571956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:53,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:53,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:09:53,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643856921] [2025-03-04 01:09:53,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:53,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:09:53,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:53,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:09:53,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:09:53,816 INFO L87 Difference]: Start difference. First operand 619 states and 825 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:53,905 INFO L93 Difference]: Finished difference Result 1240 states and 1652 transitions. [2025-03-04 01:09:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:09:53,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 128 [2025-03-04 01:09:53,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:53,907 INFO L225 Difference]: With dead ends: 1240 [2025-03-04 01:09:53,907 INFO L226 Difference]: Without dead ends: 624 [2025-03-04 01:09:53,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:09:53,908 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:53,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 543 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:53,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-04 01:09:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 611. [2025-03-04 01:09:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 548 states have (on average 1.2791970802919708) internal successors, (701), 551 states have internal predecessors, (701), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:09:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 813 transitions. [2025-03-04 01:09:53,961 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 813 transitions. Word has length 128 [2025-03-04 01:09:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:53,961 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 813 transitions. [2025-03-04 01:09:53,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 813 transitions. [2025-03-04 01:09:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:53,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:53,962 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:53,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:09:53,962 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:53,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:53,962 INFO L85 PathProgramCache]: Analyzing trace with hash -175599468, now seen corresponding path program 1 times [2025-03-04 01:09:53,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:53,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441417379] [2025-03-04 01:09:53,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:53,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:53,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:53,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:53,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:54,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441417379] [2025-03-04 01:09:54,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441417379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:54,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:54,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:09:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164676016] [2025-03-04 01:09:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:54,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:09:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:54,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:09:54,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:54,306 INFO L87 Difference]: Start difference. First operand 611 states and 813 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:54,545 INFO L93 Difference]: Finished difference Result 1219 states and 1623 transitions. [2025-03-04 01:09:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:09:54,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2025-03-04 01:09:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:54,548 INFO L225 Difference]: With dead ends: 1219 [2025-03-04 01:09:54,548 INFO L226 Difference]: Without dead ends: 611 [2025-03-04 01:09:54,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:54,550 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:54,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 946 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2025-03-04 01:09:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2025-03-04 01:09:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 548 states have (on average 1.27007299270073) internal successors, (696), 551 states have internal predecessors, (696), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:09:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 808 transitions. [2025-03-04 01:09:54,642 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 808 transitions. Word has length 129 [2025-03-04 01:09:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:54,642 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 808 transitions. [2025-03-04 01:09:54,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 808 transitions. [2025-03-04 01:09:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:54,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:54,643 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:54,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:09:54,643 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:54,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:54,643 INFO L85 PathProgramCache]: Analyzing trace with hash 517502229, now seen corresponding path program 1 times [2025-03-04 01:09:54,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:54,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481082813] [2025-03-04 01:09:54,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:54,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:54,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:54,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:54,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:54,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:54,997 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:54,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:54,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481082813] [2025-03-04 01:09:54,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481082813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:54,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:54,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:09:54,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476798335] [2025-03-04 01:09:54,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:54,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:09:54,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:54,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:09:54,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:09:54,999 INFO L87 Difference]: Start difference. First operand 611 states and 808 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:55,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:55,424 INFO L93 Difference]: Finished difference Result 1554 states and 2074 transitions. [2025-03-04 01:09:55,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:09:55,425 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2025-03-04 01:09:55,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:55,427 INFO L225 Difference]: With dead ends: 1554 [2025-03-04 01:09:55,428 INFO L226 Difference]: Without dead ends: 946 [2025-03-04 01:09:55,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:09:55,429 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 111 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 2257 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:55,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 2257 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:09:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-03-04 01:09:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 674. [2025-03-04 01:09:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 611 states have (on average 1.2635024549918168) internal successors, (772), 614 states have internal predecessors, (772), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:09:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 884 transitions. [2025-03-04 01:09:55,487 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 884 transitions. Word has length 129 [2025-03-04 01:09:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:55,487 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 884 transitions. [2025-03-04 01:09:55,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 12 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 884 transitions. [2025-03-04 01:09:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:55,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:55,488 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:55,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:09:55,488 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:55,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:55,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1766840491, now seen corresponding path program 1 times [2025-03-04 01:09:55,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:55,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765210977] [2025-03-04 01:09:55,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:55,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:55,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:55,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:55,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:56,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:56,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765210977] [2025-03-04 01:09:56,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765210977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:56,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:56,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:09:56,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967845266] [2025-03-04 01:09:56,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:56,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:09:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:56,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:09:56,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:09:56,118 INFO L87 Difference]: Start difference. First operand 674 states and 884 transitions. Second operand has 15 states, 13 states have (on average 5.538461538461538) internal successors, (72), 15 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:56,666 INFO L93 Difference]: Finished difference Result 1419 states and 1866 transitions. [2025-03-04 01:09:56,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:09:56,667 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.538461538461538) internal successors, (72), 15 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 129 [2025-03-04 01:09:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:56,669 INFO L225 Difference]: With dead ends: 1419 [2025-03-04 01:09:56,669 INFO L226 Difference]: Without dead ends: 748 [2025-03-04 01:09:56,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:09:56,670 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 248 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1268 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:56,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1268 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:09:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2025-03-04 01:09:56,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 676. [2025-03-04 01:09:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 613 states have (on average 1.2626427406199021) internal successors, (774), 616 states have internal predecessors, (774), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 53 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-04 01:09:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 886 transitions. [2025-03-04 01:09:56,727 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 886 transitions. Word has length 129 [2025-03-04 01:09:56,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:56,727 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 886 transitions. [2025-03-04 01:09:56,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.538461538461538) internal successors, (72), 15 states have internal predecessors, (72), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:09:56,728 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 886 transitions. [2025-03-04 01:09:56,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:56,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:56,729 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:56,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-04 01:09:56,729 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:56,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:56,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2016958674, now seen corresponding path program 1 times [2025-03-04 01:09:56,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:56,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844099926] [2025-03-04 01:09:56,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:56,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:56,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:56,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:56,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844099926] [2025-03-04 01:09:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844099926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:56,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:56,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:09:56,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518162261] [2025-03-04 01:09:56,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:56,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:09:56,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:56,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:09:56,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:09:56,921 INFO L87 Difference]: Start difference. First operand 676 states and 886 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:57,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:57,029 INFO L93 Difference]: Finished difference Result 747 states and 974 transitions. [2025-03-04 01:09:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:09:57,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 129 [2025-03-04 01:09:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:57,032 INFO L225 Difference]: With dead ends: 747 [2025-03-04 01:09:57,032 INFO L226 Difference]: Without dead ends: 745 [2025-03-04 01:09:57,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-04 01:09:57,032 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 96 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:57,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 847 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:09:57,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-04 01:09:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 744. [2025-03-04 01:09:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 670 states have (on average 1.2582089552238807) internal successors, (843), 674 states have internal predecessors, (843), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:09:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 967 transitions. [2025-03-04 01:09:57,104 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 967 transitions. Word has length 129 [2025-03-04 01:09:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:57,104 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 967 transitions. [2025-03-04 01:09:57,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:09:57,105 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 967 transitions. [2025-03-04 01:09:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:57,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:57,105 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:57,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 01:09:57,105 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:57,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:57,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2016035153, now seen corresponding path program 1 times [2025-03-04 01:09:57,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:57,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447919095] [2025-03-04 01:09:57,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:57,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:57,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:57,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:57,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:57,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:57,349 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:57,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:57,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447919095] [2025-03-04 01:09:57,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447919095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:57,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:57,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:09:57,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747431545] [2025-03-04 01:09:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:57,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:09:57,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:57,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:09:57,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:09:57,350 INFO L87 Difference]: Start difference. First operand 744 states and 967 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:57,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:57,661 INFO L93 Difference]: Finished difference Result 1721 states and 2239 transitions. [2025-03-04 01:09:57,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:09:57,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2025-03-04 01:09:57,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:57,665 INFO L225 Difference]: With dead ends: 1721 [2025-03-04 01:09:57,665 INFO L226 Difference]: Without dead ends: 1013 [2025-03-04 01:09:57,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:09:57,666 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 105 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:57,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1011 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-03-04 01:09:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 800. [2025-03-04 01:09:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 718 states have (on average 1.256267409470752) internal successors, (902), 722 states have internal predecessors, (902), 68 states have call successors, (68), 13 states have call predecessors, (68), 13 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:09:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1038 transitions. [2025-03-04 01:09:57,746 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1038 transitions. Word has length 129 [2025-03-04 01:09:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:57,746 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1038 transitions. [2025-03-04 01:09:57,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1038 transitions. [2025-03-04 01:09:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:57,747 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:57,747 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:57,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 01:09:57,747 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:57,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2082418638, now seen corresponding path program 1 times [2025-03-04 01:09:57,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:57,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227201280] [2025-03-04 01:09:57,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:57,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:57,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:57,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:57,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:57,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:09:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:09:58,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:09:58,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227201280] [2025-03-04 01:09:58,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227201280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:09:58,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:09:58,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:09:58,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144511246] [2025-03-04 01:09:58,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:09:58,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:09:58,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:09:58,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:09:58,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:09:58,238 INFO L87 Difference]: Start difference. First operand 800 states and 1038 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:09:58,597 INFO L93 Difference]: Finished difference Result 1764 states and 2275 transitions. [2025-03-04 01:09:58,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:09:58,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2025-03-04 01:09:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:09:58,601 INFO L225 Difference]: With dead ends: 1764 [2025-03-04 01:09:58,601 INFO L226 Difference]: Without dead ends: 1012 [2025-03-04 01:09:58,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:09:58,602 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 220 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:09:58,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1093 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:09:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-03-04 01:09:58,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 839. [2025-03-04 01:09:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 751 states have (on average 1.2476697736351532) internal successors, (937), 755 states have internal predecessors, (937), 68 states have call successors, (68), 19 states have call predecessors, (68), 19 states have return successors, (68), 64 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:09:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1073 transitions. [2025-03-04 01:09:58,693 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1073 transitions. Word has length 129 [2025-03-04 01:09:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:09:58,694 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1073 transitions. [2025-03-04 01:09:58,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 9 states have internal predecessors, (72), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:09:58,694 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1073 transitions. [2025-03-04 01:09:58,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:09:58,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:09:58,694 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:58,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 01:09:58,695 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:09:58,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:09:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1325044977, now seen corresponding path program 1 times [2025-03-04 01:09:58,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:09:58,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045621919] [2025-03-04 01:09:58,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:09:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:09:58,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:58,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:58,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:58,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:09:58,731 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:09:58,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:09:58,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:09:58,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:09:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:09:58,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:09:58,821 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:09:58,822 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:09:58,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-04 01:09:58,826 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:09:58,905 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:09:58,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:09:58 BoogieIcfgContainer [2025-03-04 01:09:58,909 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:09:58,910 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:09:58,910 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:09:58,910 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:09:58,911 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:09:11" (3/4) ... [2025-03-04 01:09:58,912 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:09:58,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:09:58,914 INFO L158 Benchmark]: Toolchain (without parser) took 48440.57ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 135.0MB in the beginning and 476.6MB in the end (delta: -341.5MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2025-03-04 01:09:58,914 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:09:58,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.58ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 119.8MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:09:58,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.66ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 115.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:09:58,915 INFO L158 Benchmark]: Boogie Preprocessor took 62.24ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 110.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:09:58,915 INFO L158 Benchmark]: IcfgBuilder took 617.75ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 73.9MB in the end (delta: 36.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:09:58,917 INFO L158 Benchmark]: TraceAbstraction took 47444.68ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 73.4MB in the beginning and 476.7MB in the end (delta: -403.3MB). Peak memory consumption was 270.2MB. Max. memory is 16.1GB. [2025-03-04 01:09:58,917 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 545.3MB. Free memory was 476.7MB in the beginning and 476.6MB in the end (delta: 175.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:09:58,918 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 125.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.58ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 119.8MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.66ms. Allocated memory is still 167.8MB. Free memory was 119.8MB in the beginning and 115.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.24ms. Allocated memory is still 167.8MB. Free memory was 115.7MB in the beginning and 110.6MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 617.75ms. Allocated memory is still 167.8MB. Free memory was 110.6MB in the beginning and 73.9MB in the end (delta: 36.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 47444.68ms. Allocated memory was 167.8MB in the beginning and 545.3MB in the end (delta: 377.5MB). Free memory was 73.4MB in the beginning and 476.7MB in the end (delta: -403.3MB). Peak memory consumption was 270.2MB. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 545.3MB. Free memory was 476.7MB in the beginning and 476.6MB in the end (delta: 175.4kB). 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 someBinaryArithmeticDOUBLEoperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L25-L27] double double_Array_0[5] = { 255.375, 255.6, 8.3, 10000000.375, 0.0 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L28-L30] signed char signed_char_Array_0[3] = { 5, 1, 25 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -50 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { -50 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 50, 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 19138, 0 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L65] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] double_Array_0[0] = __VERIFIER_nondet_double() [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L69] EXPR double_Array_0[0] [L69] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 4611686.018427382800e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] double_Array_0[1] = __VERIFIER_nondet_double() [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L71] EXPR double_Array_0[1] [L71] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] double_Array_0[3] = __VERIFIER_nondet_double() [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F [L73] EXPR double_Array_0[3] [L73] EXPR double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] EXPR (double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not((double_Array_0[3] >= 0.0F && double_Array_0[3] <= -1.0e-20F) || (double_Array_0[3] <= 9223372.036854765600e+12F && double_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] double_Array_0[4] = __VERIFIER_nondet_double() [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F [L75] EXPR double_Array_0[4] [L75] EXPR double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR (double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR (double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not((double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not((double_Array_0[4] >= 4611686.018427382800e+12F && double_Array_0[4] <= -1.0e-20F) || (double_Array_0[4] <= 9223372.036854765600e+12F && double_Array_0[4] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[0] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L80] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L83] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L97] RET updateVariables() [L98] CALL step() [L43] EXPR unsigned_char_Array_0[1] [L43] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L44] EXPR signed_char_Array_0[0] [L44] signed_char_Array_0[1] = signed_char_Array_0[0] [L45] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(BOOL_unsigned_char_Array_0[0]) [L48] EXPR BOOL_unsigned_char_Array_0[0] [L48] BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L48] COND FALSE !(BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) [L51] EXPR unsigned_short_int_Array_0[0] [L51] unsigned short int stepLocal_0 = unsigned_short_int_Array_0[0]; [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-32769, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) [L52] EXPR unsigned_char_Array_0[0] [L52] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-32769, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, stepLocal_0=-32769, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L52] COND FALSE !(stepLocal_0 <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) [L55] EXPR unsigned_char_Array_0[0] [L55] EXPR unsigned_short_int_Array_0[1] [L55] EXPR unsigned_short_int_Array_0[0] [L55] signed_long_int_Array_0[0] = (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])) [L57] EXPR unsigned_char_Array_0[0] [L57] unsigned char stepLocal_1 = unsigned_char_Array_0[0]; [L58] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND FALSE !(unsigned_char_Array_0[0] < stepLocal_1) [L61] EXPR double_Array_0[4] [L61] EXPR double_Array_0[0] [L61] EXPR double_Array_0[1] [L61] double_Array_0[2] = ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1 [L89] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) [L89] EXPR BOOL_unsigned_char_Array_0[0] [L89] EXPR BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1 [L89] EXPR (BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) [L89] EXPR unsigned_short_int_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR unsigned_char_Array_0[0] << unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))) [L89] EXPR signed_long_int_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_short_int_Array_0[1] [L89] EXPR unsigned_short_int_Array_0[0] [L89] EXPR (unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) [L89] EXPR unsigned_char_Array_0[0] [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))) [L89] EXPR double_Array_0[2] [L89] EXPR double_Array_0[4] [L89] EXPR double_Array_0[0] [L89] EXPR double_Array_0[1] [L89] EXPR (unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89-L90] return (((((BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((17222 - unsigned_char_Array_0[0]) + (((((29916) < (unsigned_short_int_Array_0[0])) ? (29916) : (unsigned_short_int_Array_0[0]))) - unsigned_char_Array_0[0])))) : 1) && ((BOOL_unsigned_char_Array_0[0] && (unsigned_short_int_Array_0[0] >= (unsigned_char_Array_0[0] + unsigned_short_int_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) 8)) : 1)) && ((unsigned_short_int_Array_0[0] <= ((((unsigned_char_Array_0[0]) > ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))) ? (unsigned_char_Array_0[0]) : ((unsigned_char_Array_0[0] << unsigned_char_Array_0[0]))))) ? (signed_long_int_Array_0[0] == ((signed long int) (((((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) < (unsigned_short_int_Array_0[0])) ? ((unsigned_char_Array_0[0] - unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0]))))) : (signed_long_int_Array_0[0] == ((signed long int) (unsigned_char_Array_0[0] + (unsigned_short_int_Array_0[1] + unsigned_short_int_Array_0[0])))))) && ((unsigned_char_Array_0[0] < unsigned_char_Array_0[0]) ? (double_Array_0[2] == ((double) (double_Array_0[1] - double_Array_0[3]))) : (double_Array_0[2] == ((double) ((double_Array_0[4] - double_Array_0[0]) - double_Array_0[1]))))) && (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1]))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[0])) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 47.3s, OverallIterations: 35, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4810 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4780 mSDsluCounter, 39545 SdHoareTripleChecker+Invalid, 15.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32822 mSDsCounter, 336 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11724 IncrementalHoareTripleChecker+Invalid, 12060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 336 mSolverCounterUnsat, 6723 mSDtfsCounter, 11724 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1051 GetRequests, 732 SyntacticMatches, 7 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=839occurred in iteration=34, InterpolantAutomatonStates: 306, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 34 MinimizatonAttempts, 3285 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 4904 NumberOfCodeBlocks, 4904 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4736 ConstructedInterpolants, 0 QuantifiedInterpolants, 20849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2168 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 39 InterpolantComputations, 34 PerfectInterpolantSequences, 10142/10296 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:09:58,938 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-a_file-70.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 f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:10:00,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:10:00,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:10:00,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:10:00,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:10:00,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:10:00,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:10:00,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:10:00,883 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:10:00,883 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:10:00,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:10:00,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:10:00,884 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:10:00,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:10:00,885 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:10:00,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:10:00,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:10:00,885 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:10:00,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:10:00,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:10:00,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:10:00,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:10:00,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:10:00,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:10:00,886 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:10:00,886 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:10:00,886 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:10:00,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:10:00,886 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:10:00,886 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:10:00,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:10:00,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:10:00,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:10:00,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:10:00,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:10:00,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:10:00,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:10:00,888 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:10:00,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:10:00,888 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:10:00,888 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:10:00,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:10:00,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:10:00,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:10:00,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:10:00,888 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 -> f2cb36cc0f0fd05117e5167c95d28ca6a711637d120a8a77c2820981a0c818fc [2025-03-04 01:10:01,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:10:01,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:10:01,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:10:01,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:10:01,115 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:10:01,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2025-03-04 01:10:02,271 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf25bcdf/8677146cdf7a4670a3794c78628cb21a/FLAGf00a73a22 [2025-03-04 01:10:02,445 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:10:02,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-70.i [2025-03-04 01:10:02,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf25bcdf/8677146cdf7a4670a3794c78628cb21a/FLAGf00a73a22 [2025-03-04 01:10:02,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cf25bcdf/8677146cdf7a4670a3794c78628cb21a [2025-03-04 01:10:02,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:10:02,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:10:02,840 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:10:02,840 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:10:02,843 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:10:02,844 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:10:02" (1/1) ... [2025-03-04 01:10:02,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@364f5da7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:02, skipping insertion in model container [2025-03-04 01:10:02,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:10:02" (1/1) ... [2025-03-04 01:10:02,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:10:02,937 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-a_file-70.i[916,929] [2025-03-04 01:10:02,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:10:02,982 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:10:02,989 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-a_file-70.i[916,929] [2025-03-04 01:10:03,016 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:10:03,030 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:10:03,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03 WrapperNode [2025-03-04 01:10:03,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:10:03,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:10:03,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:10:03,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:10:03,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,072 INFO L138 Inliner]: procedures = 36, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-03-04 01:10:03,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:10:03,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:10:03,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:10:03,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:10:03,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,109 INFO L175 MemorySlicer]: Split 132 memory accesses to 7 slices as follows [2, 8, 39, 12, 5, 41, 25]. 31 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 5, 3, 1, 2, 2]. The 16 writes are split as follows [0, 1, 6, 3, 2, 2, 2]. [2025-03-04 01:10:03,110 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,110 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,126 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:10:03,147 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:10:03,147 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:10:03,147 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:10:03,148 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (1/1) ... [2025-03-04 01:10:03,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:10:03,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:10:03,178 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:10:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:10:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:10:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:10:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:10:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-04 01:10:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-04 01:10:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-04 01:10:03,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:10:03,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:10:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:10:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:10:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:10:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:10:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:10:03,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:10:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:10:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:10:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:10:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-04 01:10:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:10:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:10:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:10:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:10:03,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:10:03,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:10:03,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:10:03,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:10:03,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:10:03,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:10:03,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:10:03,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:10:03,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:10:03,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:10:03,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:10:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:10:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:10:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:10:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:10:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:10:03,362 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:10:03,364 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:10:05,672 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~mem86#1;havoc property_#t~ite93#1;havoc property_#t~mem92#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~mem91#1;havoc property_#t~mem97#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short98#1;havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~short101#1;havoc property_#t~mem109#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite108#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite122#1;havoc property_#t~mem117#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite116#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~ite133#1;havoc property_#t~mem128#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~mem132#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#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-04 01:10:05,703 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2025-03-04 01:10:05,703 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:10:05,713 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:10:05,713 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:10:05,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:05 BoogieIcfgContainer [2025-03-04 01:10:05,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:10:05,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:10:05,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:10:05,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:10:05,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:10:02" (1/3) ... [2025-03-04 01:10:05,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19538fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:10:05, skipping insertion in model container [2025-03-04 01:10:05,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:10:03" (2/3) ... [2025-03-04 01:10:05,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19538fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:10:05, skipping insertion in model container [2025-03-04 01:10:05,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:10:05" (3/3) ... [2025-03-04 01:10:05,722 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-70.i [2025-03-04 01:10:05,732 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:10:05,733 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-70.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:10:05,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:10:05,773 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;@124977bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:10:05,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:10:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:10:05,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:05,785 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:05,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:05,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:05,789 INFO L85 PathProgramCache]: Analyzing trace with hash -214176694, now seen corresponding path program 1 times [2025-03-04 01:10:05,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:05,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697416734] [2025-03-04 01:10:05,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:05,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:05,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:05,803 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:05,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:10:05,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:10:06,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:10:06,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:06,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:06,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:10:06,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:06,176 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 01:10:06,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:06,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:06,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697416734] [2025-03-04 01:10:06,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697416734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:06,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:06,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:10:06,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401612130] [2025-03-04 01:10:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:06,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:10:06,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:06,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:10:06,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:10:06,227 INFO L87 Difference]: Start difference. First operand has 100 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 86 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:10:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:06,248 INFO L93 Difference]: Finished difference Result 194 states and 299 transitions. [2025-03-04 01:10:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:10:06,249 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-03-04 01:10:06,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:06,253 INFO L225 Difference]: With dead ends: 194 [2025-03-04 01:10:06,253 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 01:10:06,255 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-04 01:10:06,257 INFO L435 NwaCegarLoop]: 141 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, 141 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:06,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 01:10:06,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 01:10:06,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 83 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 141 transitions. [2025-03-04 01:10:06,291 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 141 transitions. Word has length 115 [2025-03-04 01:10:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:06,291 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 141 transitions. [2025-03-04 01:10:06,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:10:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 141 transitions. [2025-03-04 01:10:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:10:06,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:06,295 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:06,305 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-04 01:10:06,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:06,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:06,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:06,497 INFO L85 PathProgramCache]: Analyzing trace with hash 579826946, now seen corresponding path program 1 times [2025-03-04 01:10:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:06,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420090887] [2025-03-04 01:10:06,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:06,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:06,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:06,500 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:06,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:10:06,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:10:06,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:10:06,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:06,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:06,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:10:06,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-04 01:10:07,136 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:10:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:10:07,291 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:07,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420090887] [2025-03-04 01:10:07,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420090887] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:07,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:10:07,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-04 01:10:07,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424134327] [2025-03-04 01:10:07,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:07,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:07,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:07,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:07,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:10:07,293 INFO L87 Difference]: Start difference. First operand 97 states and 141 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:07,419 INFO L93 Difference]: Finished difference Result 234 states and 342 transitions. [2025-03-04 01:10:07,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:10:07,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:10:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:07,423 INFO L225 Difference]: With dead ends: 234 [2025-03-04 01:10:07,424 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 01:10:07,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:10:07,425 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 121 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:07,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 393 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:07,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 01:10:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2025-03-04 01:10:07,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2025-03-04 01:10:07,438 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 115 [2025-03-04 01:10:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:07,439 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2025-03-04 01:10:07,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2025-03-04 01:10:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:10:07,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:07,440 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:07,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:10:07,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:07,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:07,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash -213464862, now seen corresponding path program 1 times [2025-03-04 01:10:07,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:07,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411303561] [2025-03-04 01:10:07,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:07,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:07,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:07,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:07,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:10:07,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:10:07,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:10:07,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:07,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:07,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:10:07,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:10:07,964 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:07,964 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:07,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411303561] [2025-03-04 01:10:07,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411303561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:07,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:07,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:10:07,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234998718] [2025-03-04 01:10:07,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:07,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:10:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:07,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:10:07,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:10:07,966 INFO L87 Difference]: Start difference. First operand 100 states and 144 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:08,002 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2025-03-04 01:10:08,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:10:08,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2025-03-04 01:10:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:08,003 INFO L225 Difference]: With dead ends: 199 [2025-03-04 01:10:08,003 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 01:10:08,004 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-04 01:10:08,004 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 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-04 01:10:08,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:08,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 01:10:08,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-04 01:10:08,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.3863636363636365) internal successors, (122), 88 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:08,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 146 transitions. [2025-03-04 01:10:08,011 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 146 transitions. Word has length 115 [2025-03-04 01:10:08,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:08,011 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 146 transitions. [2025-03-04 01:10:08,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 146 transitions. [2025-03-04 01:10:08,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-04 01:10:08,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:08,013 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:08,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:10:08,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:08,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:08,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1135359872, now seen corresponding path program 1 times [2025-03-04 01:10:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076469913] [2025-03-04 01:10:08,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:08,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:08,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:08,218 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:08,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:10:08,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-04 01:10:08,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-04 01:10:08,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:08,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:08,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:10:08,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-04 01:10:08,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:10:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:10:08,906 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076469913] [2025-03-04 01:10:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076469913] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:08,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:10:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-04 01:10:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21538949] [2025-03-04 01:10:08,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:08,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:08,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:08,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:08,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:10:08,908 INFO L87 Difference]: Start difference. First operand 102 states and 146 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:08,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:08,964 INFO L93 Difference]: Finished difference Result 239 states and 342 transitions. [2025-03-04 01:10:08,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:10:08,967 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2025-03-04 01:10:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:08,968 INFO L225 Difference]: With dead ends: 239 [2025-03-04 01:10:08,968 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 01:10:08,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:10:08,969 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 94 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:08,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 395 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:08,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 01:10:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 112. [2025-03-04 01:10:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 98 states have internal predecessors, (136), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:08,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-03-04 01:10:08,974 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 117 [2025-03-04 01:10:08,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:08,974 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-03-04 01:10:08,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-03-04 01:10:08,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:10:08,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:08,976 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:08,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-04 01:10:09,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:09,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:09,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:09,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2004504075, now seen corresponding path program 1 times [2025-03-04 01:10:09,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:09,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114261768] [2025-03-04 01:10:09,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:09,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:09,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:09,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:09,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:10:09,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:10:09,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:10:09,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:09,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:09,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:10:09,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:09,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 53 proven. 30 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-03-04 01:10:09,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:10:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:10:09,824 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:09,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114261768] [2025-03-04 01:10:09,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114261768] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:10:09,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:10:09,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2025-03-04 01:10:09,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654194755] [2025-03-04 01:10:09,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:09,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:09,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:09,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:10:09,825 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:09,878 INFO L93 Difference]: Finished difference Result 250 states and 357 transitions. [2025-03-04 01:10:09,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:10:09,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-04 01:10:09,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:09,880 INFO L225 Difference]: With dead ends: 250 [2025-03-04 01:10:09,880 INFO L226 Difference]: Without dead ends: 141 [2025-03-04 01:10:09,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:10:09,881 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 43 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:09,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 522 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:09,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-04 01:10:09,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2025-03-04 01:10:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2025-03-04 01:10:09,888 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 118 [2025-03-04 01:10:09,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:09,888 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2025-03-04 01:10:09,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:09,888 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2025-03-04 01:10:09,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 01:10:09,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:09,889 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:09,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:10:10,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:10,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:10,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:10,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1002510891, now seen corresponding path program 1 times [2025-03-04 01:10:10,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:10,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111103461] [2025-03-04 01:10:10,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:10,095 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:10,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:10,097 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:10,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:10:10,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 01:10:10,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 01:10:10,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:10,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:10,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:10:10,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:10:10,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:10,379 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:10,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111103461] [2025-03-04 01:10:10,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111103461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:10,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:10,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:10,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533538400] [2025-03-04 01:10:10,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:10,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:10:10,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:10,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:10:10,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:10,383 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:10,416 INFO L93 Difference]: Finished difference Result 232 states and 329 transitions. [2025-03-04 01:10:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:10:10,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2025-03-04 01:10:10,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:10,419 INFO L225 Difference]: With dead ends: 232 [2025-03-04 01:10:10,419 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:10:10,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:10:10,419 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:10,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:10:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 01:10:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.361904761904762) internal successors, (143), 105 states have internal predecessors, (143), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:10,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2025-03-04 01:10:10,431 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 118 [2025-03-04 01:10:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:10,431 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2025-03-04 01:10:10,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2025-03-04 01:10:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:10:10,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:10,432 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:10,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:10:10,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:10,633 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:10,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:10,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1807754690, now seen corresponding path program 1 times [2025-03-04 01:10:10,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:10,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943872750] [2025-03-04 01:10:10,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:10,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:10,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:10,636 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:10,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:10:10,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:10:10,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:10:10,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:10,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:10,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:10:10,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:10:10,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:10,934 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:10,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943872750] [2025-03-04 01:10:10,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943872750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:10,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:10,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:10:10,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44420024] [2025-03-04 01:10:10,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:10,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:10,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:10,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:10,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:10,936 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:10,992 INFO L93 Difference]: Finished difference Result 242 states and 341 transitions. [2025-03-04 01:10:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:10:10,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-04 01:10:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:10,993 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:10:10,993 INFO L226 Difference]: Without dead ends: 126 [2025-03-04 01:10:10,994 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-04 01:10:10,994 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:10,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 652 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:10:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-04 01:10:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2025-03-04 01:10:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.3423423423423424) internal successors, (149), 111 states have internal predecessors, (149), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 173 transitions. [2025-03-04 01:10:10,999 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 173 transitions. Word has length 119 [2025-03-04 01:10:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:10,999 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 173 transitions. [2025-03-04 01:10:10,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 173 transitions. [2025-03-04 01:10:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:10:11,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:11,000 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:11,009 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-04 01:10:11,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:11,201 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:11,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash -920251009, now seen corresponding path program 1 times [2025-03-04 01:10:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:11,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16474301] [2025-03-04 01:10:11,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:11,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:11,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:11,203 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:11,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:10:11,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:10:11,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:10:11,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:11,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:11,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 01:10:11,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:10:11,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:11,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:11,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16474301] [2025-03-04 01:10:11,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16474301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:11,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:11,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:10:11,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164173408] [2025-03-04 01:10:11,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:11,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:10:11,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:11,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:10:11,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:10:11,508 INFO L87 Difference]: Start difference. First operand 125 states and 173 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:11,565 INFO L93 Difference]: Finished difference Result 250 states and 347 transitions. [2025-03-04 01:10:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:10:11,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2025-03-04 01:10:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:11,567 INFO L225 Difference]: With dead ends: 250 [2025-03-04 01:10:11,567 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 01:10:11,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:10:11,568 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:11,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 776 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 01:10:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-04 01:10:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.336283185840708) internal successors, (151), 113 states have internal predecessors, (151), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 175 transitions. [2025-03-04 01:10:11,572 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 175 transitions. Word has length 119 [2025-03-04 01:10:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:11,572 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 175 transitions. [2025-03-04 01:10:11,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:11,572 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 175 transitions. [2025-03-04 01:10:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 01:10:11,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:11,573 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:11,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:10:11,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:11,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:11,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:11,774 INFO L85 PathProgramCache]: Analyzing trace with hash -919327488, now seen corresponding path program 1 times [2025-03-04 01:10:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334040875] [2025-03-04 01:10:11,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:11,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:11,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:11,776 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:11,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:10:11,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 01:10:12,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 01:10:12,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:12,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:12,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:10:12,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:12,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:12,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 65 [2025-03-04 01:10:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 01:10:12,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:12,164 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:12,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334040875] [2025-03-04 01:10:12,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334040875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:12,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:12,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:12,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888284764] [2025-03-04 01:10:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:12,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:12,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:12,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:12,165 INFO L87 Difference]: Start difference. First operand 127 states and 175 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:10:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:14,806 INFO L93 Difference]: Finished difference Result 252 states and 348 transitions. [2025-03-04 01:10:14,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:10:14,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-04 01:10:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:14,818 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:10:14,818 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 01:10:14,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:10:14,819 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 127 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:14,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 440 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-04 01:10:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 01:10:14,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-04 01:10:14,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 113 states have internal predecessors, (150), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:14,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2025-03-04 01:10:14,826 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 119 [2025-03-04 01:10:14,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:14,826 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2025-03-04 01:10:14,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:10:14,826 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2025-03-04 01:10:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 01:10:14,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:14,827 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:14,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:10:15,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:15,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:15,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:15,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1005242338, now seen corresponding path program 1 times [2025-03-04 01:10:15,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:15,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758329681] [2025-03-04 01:10:15,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:15,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:15,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:15,031 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:15,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:10:15,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-04 01:10:15,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-04 01:10:15,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:15,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:15,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:10:15,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:15,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:15,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:10:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-03-04 01:10:15,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:15,425 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:15,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758329681] [2025-03-04 01:10:15,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758329681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:15,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748952748] [2025-03-04 01:10:15,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:15,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:15,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:15,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:15,426 INFO L87 Difference]: Start difference. First operand 127 states and 174 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:10:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:16,957 INFO L93 Difference]: Finished difference Result 252 states and 346 transitions. [2025-03-04 01:10:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:10:16,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-04 01:10:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:16,969 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:10:16,969 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 01:10:16,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:10:16,970 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 118 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:16,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 436 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 01:10:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 01:10:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-04 01:10:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.3185840707964602) internal successors, (149), 113 states have internal predecessors, (149), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 173 transitions. [2025-03-04 01:10:16,974 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 173 transitions. Word has length 121 [2025-03-04 01:10:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:16,974 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 173 transitions. [2025-03-04 01:10:16,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:10:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 173 transitions. [2025-03-04 01:10:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:10:16,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:16,975 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:16,985 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-04 01:10:17,175 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-04 01:10:17,176 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:17,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:17,176 INFO L85 PathProgramCache]: Analyzing trace with hash 808334815, now seen corresponding path program 1 times [2025-03-04 01:10:17,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:17,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836559271] [2025-03-04 01:10:17,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:17,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:17,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:17,178 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-04 01:10:17,179 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-04 01:10:17,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:10:17,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:10:17,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:17,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:17,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:10:17,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-04 01:10:17,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:17,511 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:17,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836559271] [2025-03-04 01:10:17,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836559271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:17,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:17,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:10:17,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774638736] [2025-03-04 01:10:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:17,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:17,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:17,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:17,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:17,512 INFO L87 Difference]: Start difference. First operand 127 states and 173 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:10:17,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:17,653 INFO L93 Difference]: Finished difference Result 255 states and 348 transitions. [2025-03-04 01:10:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:10:17,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 123 [2025-03-04 01:10:17,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:17,655 INFO L225 Difference]: With dead ends: 255 [2025-03-04 01:10:17,655 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 01:10:17,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:10:17,656 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:17,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 584 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:10:17,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 01:10:17,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2025-03-04 01:10:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 113 states have internal predecessors, (148), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:17,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 172 transitions. [2025-03-04 01:10:17,663 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 172 transitions. Word has length 123 [2025-03-04 01:10:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:17,663 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 172 transitions. [2025-03-04 01:10:17,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:10:17,665 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 172 transitions. [2025-03-04 01:10:17,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:10:17,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:17,666 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:17,676 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-04 01:10:17,866 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-04 01:10:17,867 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:17,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:17,867 INFO L85 PathProgramCache]: Analyzing trace with hash 822584960, now seen corresponding path program 1 times [2025-03-04 01:10:17,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:17,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283884482] [2025-03-04 01:10:17,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:17,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:17,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:17,871 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-04 01:10:17,872 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-04 01:10:17,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:10:18,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:10:18,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:18,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:18,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:10:18,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:18,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:18,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-04 01:10:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-04 01:10:18,287 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:18,287 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:18,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283884482] [2025-03-04 01:10:18,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283884482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:18,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:18,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:18,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579885211] [2025-03-04 01:10:18,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:18,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:18,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:18,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:18,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:18,288 INFO L87 Difference]: Start difference. First operand 127 states and 172 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:10:19,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:10:20,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:20,655 INFO L93 Difference]: Finished difference Result 252 states and 342 transitions. [2025-03-04 01:10:20,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:10:20,667 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-03-04 01:10:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:20,668 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:10:20,668 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 01:10:20,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:10:20,668 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 108 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:20,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 428 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-04 01:10:20,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 01:10:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-04 01:10:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.3008849557522124) internal successors, (147), 113 states have internal predecessors, (147), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:20,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 171 transitions. [2025-03-04 01:10:20,672 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 171 transitions. Word has length 123 [2025-03-04 01:10:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:20,673 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 171 transitions. [2025-03-04 01:10:20,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:10:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 171 transitions. [2025-03-04 01:10:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:10:20,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:20,673 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:20,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2025-03-04 01:10:20,874 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-04 01:10:20,874 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:20,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:20,874 INFO L85 PathProgramCache]: Analyzing trace with hash -947157150, now seen corresponding path program 1 times [2025-03-04 01:10:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:20,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514800916] [2025-03-04 01:10:20,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:20,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:20,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:20,878 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-04 01:10:20,879 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-04 01:10:20,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:10:21,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:10:21,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:21,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:21,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:10:21,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:21,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:21,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 175 treesize of output 67 [2025-03-04 01:10:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-04 01:10:21,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:21,329 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514800916] [2025-03-04 01:10:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514800916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:10:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16912753] [2025-03-04 01:10:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:21,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:10:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:21,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:10:21,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:10:21,331 INFO L87 Difference]: Start difference. First operand 127 states and 171 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:10:24,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:10:24,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:24,087 INFO L93 Difference]: Finished difference Result 252 states and 340 transitions. [2025-03-04 01:10:24,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:10:24,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-03-04 01:10:24,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:24,101 INFO L225 Difference]: With dead ends: 252 [2025-03-04 01:10:24,101 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 01:10:24,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:10:24,101 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 98 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:24,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 421 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 01:10:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 01:10:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2025-03-04 01:10:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 170 transitions. [2025-03-04 01:10:24,105 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 170 transitions. Word has length 125 [2025-03-04 01:10:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:24,105 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 170 transitions. [2025-03-04 01:10:24,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:10:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 170 transitions. [2025-03-04 01:10:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:10:24,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:24,106 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:24,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2025-03-04 01:10:24,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:24,307 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:24,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:24,307 INFO L85 PathProgramCache]: Analyzing trace with hash 2068017152, now seen corresponding path program 1 times [2025-03-04 01:10:24,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:24,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187415914] [2025-03-04 01:10:24,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:24,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:24,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:24,314 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:24,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-04 01:10:24,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:10:24,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:10:24,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:24,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:24,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:10:24,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:24,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 01:10:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:10:24,668 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:24,668 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187415914] [2025-03-04 01:10:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187415914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:24,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:24,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:10:24,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823657781] [2025-03-04 01:10:24,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:24,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:10:24,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:24,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:10:24,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:10:24,669 INFO L87 Difference]: Start difference. First operand 127 states and 170 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:25,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:10:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:25,826 INFO L93 Difference]: Finished difference Result 251 states and 337 transitions. [2025-03-04 01:10:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:10:25,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2025-03-04 01:10:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:25,828 INFO L225 Difference]: With dead ends: 251 [2025-03-04 01:10:25,828 INFO L226 Difference]: Without dead ends: 127 [2025-03-04 01:10:25,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 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-04 01:10:25,829 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:25,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:10:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-04 01:10:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-04 01:10:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.2743362831858407) internal successors, (144), 113 states have internal predecessors, (144), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 168 transitions. [2025-03-04 01:10:25,834 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 168 transitions. Word has length 127 [2025-03-04 01:10:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:25,834 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 168 transitions. [2025-03-04 01:10:25,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2025-03-04 01:10:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:10:25,835 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:25,835 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:25,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2025-03-04 01:10:26,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:26,036 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:26,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1223545281, now seen corresponding path program 1 times [2025-03-04 01:10:26,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:26,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807138442] [2025-03-04 01:10:26,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:26,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-04 01:10:26,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:26,039 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:26,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2025-03-04 01:10:26,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:10:26,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:10:26,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:26,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:26,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:10:26,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:26,469 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 26 treesize of output 22 [2025-03-04 01:10:26,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-04 01:10:26,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2025-03-04 01:10:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:10:26,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:10:26,857 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:10:26,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807138442] [2025-03-04 01:10:26,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807138442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:10:26,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:10:26,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:10:26,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292036251] [2025-03-04 01:10:26,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:10:26,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:10:26,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:10:26,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:10:26,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:10:26,858 INFO L87 Difference]: Start difference. First operand 127 states and 168 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:28,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:10:28,208 INFO L93 Difference]: Finished difference Result 461 states and 613 transitions. [2025-03-04 01:10:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:10:28,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 127 [2025-03-04 01:10:28,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:10:28,211 INFO L225 Difference]: With dead ends: 461 [2025-03-04 01:10:28,211 INFO L226 Difference]: Without dead ends: 337 [2025-03-04 01:10:28,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:10:28,211 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 238 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:10:28,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 1347 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:10:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-04 01:10:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 143. [2025-03-04 01:10:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 129 states have (on average 1.2945736434108528) internal successors, (167), 129 states have internal predecessors, (167), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:10:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 191 transitions. [2025-03-04 01:10:28,220 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 191 transitions. Word has length 127 [2025-03-04 01:10:28,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:10:28,221 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 191 transitions. [2025-03-04 01:10:28,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:10:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 191 transitions. [2025-03-04 01:10:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:10:28,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:10:28,222 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:10:28,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 (16)] Ended with exit code 0 [2025-03-04 01:10:28,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:28,422 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:10:28,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:10:28,423 INFO L85 PathProgramCache]: Analyzing trace with hash 713011104, now seen corresponding path program 1 times [2025-03-04 01:10:28,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:10:28,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138272264] [2025-03-04 01:10:28,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:10:28,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:10:28,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:10:28,425 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:10:28,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-03-04 01:10:28,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:10:28,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:10:28,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:10:28,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:10:28,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 01:10:28,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:10:28,841 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 26 treesize of output 22 [2025-03-04 01:10:29,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-04 01:10:29,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:10:29,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27