./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.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 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:18:41,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:18:41,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:18:41,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:18:41,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:18:42,000 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:18:42,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:18:42,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:18:42,001 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:18:42,002 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:18:42,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:18:42,002 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:18:42,003 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:18:42,003 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:18:42,003 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:18:42,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:18:42,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:18:42,003 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:18:42,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:18:42,003 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:18:42,004 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:18:42,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:18:42,004 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:18:42,005 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:18:42,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:18:42,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:18:42,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:18:42,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:18:42,005 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:18:42,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:18:42,005 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 -> 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 [2025-03-08 16:18:42,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:18:42,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:18:42,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:18:42,236 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:18:42,236 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:18:42,237 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-53.i [2025-03-08 16:18:43,351 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af7ffb62/690fe95f3ef74e59b1340384ef032759/FLAGa1f55b1ad [2025-03-08 16:18:43,584 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:18:43,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2025-03-08 16:18:43,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af7ffb62/690fe95f3ef74e59b1340384ef032759/FLAGa1f55b1ad [2025-03-08 16:18:43,634 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af7ffb62/690fe95f3ef74e59b1340384ef032759 [2025-03-08 16:18:43,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:18:43,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:18:43,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:18:43,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:18:43,642 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:18:43,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,643 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec30da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43, skipping insertion in model container [2025-03-08 16:18:43,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:18:43,759 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-53.i[916,929] [2025-03-08 16:18:43,812 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:18:43,822 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:18:43,831 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-53.i[916,929] [2025-03-08 16:18:43,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:18:43,887 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:18:43,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43 WrapperNode [2025-03-08 16:18:43,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:18:43,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:18:43,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:18:43,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:18:43,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,928 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2025-03-08 16:18:43,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:18:43,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:18:43,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:18:43,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:18:43,942 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,942 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,946 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,963 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 45, 20, 39, 27]. 34 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 2, 5, 2]. The 18 writes are split as follows [0, 9, 2, 5, 2]. [2025-03-08 16:18:43,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,978 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:18:43,991 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:18:43,991 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:18:43,991 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:18:43,991 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (1/1) ... [2025-03-08 16:18:43,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:18:44,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:18:44,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:18:44,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:18:44,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:18:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:18:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:18:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:18:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:18:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:18:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:18:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:18:44,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:18:44,040 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:18:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:18:44,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:18:44,144 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:18:44,146 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:18:44,562 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite116#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite113#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short117#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem121#1;havoc property_#t~ite124#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~ite136#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem135#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short134#1;havoc property_#t~short137#1; [2025-03-08 16:18:44,603 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-08 16:18:44,603 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:18:44,614 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:18:44,614 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:18:44,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:18:44 BoogieIcfgContainer [2025-03-08 16:18:44,615 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:18:44,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:18:44,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:18:44,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:18:44,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:18:43" (1/3) ... [2025-03-08 16:18:44,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eba003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:18:44, skipping insertion in model container [2025-03-08 16:18:44,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:18:43" (2/3) ... [2025-03-08 16:18:44,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15eba003 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:18:44, skipping insertion in model container [2025-03-08 16:18:44,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:18:44" (3/3) ... [2025-03-08 16:18:44,622 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-53.i [2025-03-08 16:18:44,632 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:18:44,633 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-53.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:18:44,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:18:44,691 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;@41fbbec2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:18:44,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:18:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:18:44,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:18:44,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:44,709 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:44,709 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash 863806641, now seen corresponding path program 1 times [2025-03-08 16:18:44,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:44,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489489329] [2025-03-08 16:18:44,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:44,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:44,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:18:44,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:18:44,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:44,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:18:45,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:45,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489489329] [2025-03-08 16:18:45,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489489329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:18:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729443285] [2025-03-08 16:18:45,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:45,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:18:45,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:18:45,019 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:18:45,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:18:45,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:18:45,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:18:45,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:45,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:45,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:18:45,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:18:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 16:18:45,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:18:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729443285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:45,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:18:45,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:18:45,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913043868] [2025-03-08 16:18:45,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:45,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:18:45,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:45,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:18:45,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:18:45,279 INFO L87 Difference]: Start difference. First operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:18:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:45,297 INFO L93 Difference]: Finished difference Result 216 states and 337 transitions. [2025-03-08 16:18:45,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:18:45,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-08 16:18:45,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:45,303 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:18:45,303 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:18:45,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:18:45,307 INFO L435 NwaCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:45,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:18:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:18:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:18:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:18:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-03-08 16:18:45,344 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2025-03-08 16:18:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:45,344 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-03-08 16:18:45,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:18:45,345 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-03-08 16:18:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:18:45,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:45,348 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:45,356 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-08 16:18:45,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:18:45,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:45,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:45,549 INFO L85 PathProgramCache]: Analyzing trace with hash -992856479, now seen corresponding path program 1 times [2025-03-08 16:18:45,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:45,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857067938] [2025-03-08 16:18:45,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:45,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:18:45,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:18:45,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:45,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:45,964 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:45,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:45,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857067938] [2025-03-08 16:18:45,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857067938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:45,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:45,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:18:45,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430133112] [2025-03-08 16:18:45,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:45,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:18:45,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:45,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:18:45,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:18:45,968 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:46,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:46,021 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2025-03-08 16:18:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:18:46,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-03-08 16:18:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:46,025 INFO L225 Difference]: With dead ends: 213 [2025-03-08 16:18:46,025 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:18:46,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:18:46,026 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:46,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:18:46,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:18:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:18:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:18:46,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-03-08 16:18:46,038 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2025-03-08 16:18:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:46,041 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-03-08 16:18:46,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-03-08 16:18:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:18:46,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:46,043 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:46,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:18:46,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:46,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:46,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1503390656, now seen corresponding path program 1 times [2025-03-08 16:18:46,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:46,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093434936] [2025-03-08 16:18:46,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:46,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:46,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:18:46,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:18:46,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:46,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:47,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:47,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093434936] [2025-03-08 16:18:47,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093434936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:47,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:47,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:18:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022328800] [2025-03-08 16:18:47,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:47,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:18:47,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:47,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:18:47,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:18:47,481 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:18:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:47,643 INFO L93 Difference]: Finished difference Result 215 states and 308 transitions. [2025-03-08 16:18:47,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:18:47,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-08 16:18:47,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:47,645 INFO L225 Difference]: With dead ends: 215 [2025-03-08 16:18:47,645 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 16:18:47,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:18:47,646 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 68 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:47,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 572 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:18:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 16:18:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-08 16:18:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:18:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2025-03-08 16:18:47,656 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 140 [2025-03-08 16:18:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:47,656 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2025-03-08 16:18:47,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:18:47,657 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2025-03-08 16:18:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:18:47,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:47,658 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:47,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:18:47,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:47,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:47,659 INFO L85 PathProgramCache]: Analyzing trace with hash 994625281, now seen corresponding path program 1 times [2025-03-08 16:18:47,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:47,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131715317] [2025-03-08 16:18:47,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:47,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:47,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:18:47,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:18:47,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:47,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:48,845 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:48,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:48,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131715317] [2025-03-08 16:18:48,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131715317] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:48,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:48,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:18:48,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787996184] [2025-03-08 16:18:48,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:48,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:18:48,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:48,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:18:48,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:18:48,847 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:18:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:49,251 INFO L93 Difference]: Finished difference Result 363 states and 518 transitions. [2025-03-08 16:18:49,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:18:49,251 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 140 [2025-03-08 16:18:49,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:49,253 INFO L225 Difference]: With dead ends: 363 [2025-03-08 16:18:49,255 INFO L226 Difference]: Without dead ends: 256 [2025-03-08 16:18:49,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:18:49,258 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 209 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:49,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 924 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:18:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-03-08 16:18:49,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2025-03-08 16:18:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 198 states have (on average 1.3232323232323233) internal successors, (262), 199 states have internal predecessors, (262), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:18:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 358 transitions. [2025-03-08 16:18:49,286 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 358 transitions. Word has length 140 [2025-03-08 16:18:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:49,286 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 358 transitions. [2025-03-08 16:18:49,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.571428571428571) internal successors, (53), 9 states have internal predecessors, (53), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:18:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 358 transitions. [2025-03-08 16:18:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 16:18:49,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:49,289 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:49,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:18:49,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:49,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash -331080092, now seen corresponding path program 1 times [2025-03-08 16:18:49,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:49,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034557670] [2025-03-08 16:18:49,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:49,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:49,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 16:18:49,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 16:18:49,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:49,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034557670] [2025-03-08 16:18:51,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034557670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:51,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:51,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:18:51,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8936029] [2025-03-08 16:18:51,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:51,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:18:51,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:51,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:18:51,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:18:51,241 INFO L87 Difference]: Start difference. First operand 250 states and 358 transitions. Second operand has 12 states, 8 states have (on average 6.875) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:18:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:51,758 INFO L93 Difference]: Finished difference Result 360 states and 512 transitions. [2025-03-08 16:18:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:18:51,759 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 8 states have (on average 6.875) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) Word has length 142 [2025-03-08 16:18:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:51,760 INFO L225 Difference]: With dead ends: 360 [2025-03-08 16:18:51,761 INFO L226 Difference]: Without dead ends: 253 [2025-03-08 16:18:51,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:18:51,762 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 193 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:51,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 1192 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:18:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-03-08 16:18:51,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2025-03-08 16:18:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 199 states have (on average 1.3115577889447236) internal successors, (261), 200 states have internal predecessors, (261), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:18:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 357 transitions. [2025-03-08 16:18:51,789 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 357 transitions. Word has length 142 [2025-03-08 16:18:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:51,790 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 357 transitions. [2025-03-08 16:18:51,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 8 states have (on average 6.875) internal successors, (55), 12 states have internal predecessors, (55), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-08 16:18:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 357 transitions. [2025-03-08 16:18:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:18:51,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:51,791 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:51,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:18:51,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:51,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:51,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1024683290, now seen corresponding path program 1 times [2025-03-08 16:18:51,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:51,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733706060] [2025-03-08 16:18:51,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:51,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:18:51,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:18:51,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:51,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:51,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:51,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733706060] [2025-03-08 16:18:51,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733706060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:51,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:51,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:18:51,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113958525] [2025-03-08 16:18:51,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:51,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:18:51,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:51,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:18:51,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:18:51,929 INFO L87 Difference]: Start difference. First operand 252 states and 357 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:51,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:51,972 INFO L93 Difference]: Finished difference Result 466 states and 658 transitions. [2025-03-08 16:18:51,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:18:51,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-03-08 16:18:51,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:51,974 INFO L225 Difference]: With dead ends: 466 [2025-03-08 16:18:51,975 INFO L226 Difference]: Without dead ends: 252 [2025-03-08 16:18:51,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:18:51,976 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:51,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:18:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-08 16:18:52,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2025-03-08 16:18:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 199 states have (on average 1.3015075376884422) internal successors, (259), 200 states have internal predecessors, (259), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 16:18:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 355 transitions. [2025-03-08 16:18:52,005 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 355 transitions. Word has length 145 [2025-03-08 16:18:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:52,006 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 355 transitions. [2025-03-08 16:18:52,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 355 transitions. [2025-03-08 16:18:52,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 16:18:52,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:52,007 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:52,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 16:18:52,007 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:52,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:52,008 INFO L85 PathProgramCache]: Analyzing trace with hash 731280283, now seen corresponding path program 1 times [2025-03-08 16:18:52,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:52,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081423660] [2025-03-08 16:18:52,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:52,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:52,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 16:18:52,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 16:18:52,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:52,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081423660] [2025-03-08 16:18:52,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081423660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:52,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:52,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:18:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449517991] [2025-03-08 16:18:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:52,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:18:52,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:52,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:18:52,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:18:52,763 INFO L87 Difference]: Start difference. First operand 252 states and 355 transitions. Second operand has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:18:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:52,962 INFO L93 Difference]: Finished difference Result 560 states and 775 transitions. [2025-03-08 16:18:52,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:18:52,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-08 16:18:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:52,966 INFO L225 Difference]: With dead ends: 560 [2025-03-08 16:18:52,967 INFO L226 Difference]: Without dead ends: 346 [2025-03-08 16:18:52,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:18:52,968 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 51 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:52,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 1009 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:18:52,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-08 16:18:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2025-03-08 16:18:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 283 states have (on average 1.2968197879858658) internal successors, (367), 286 states have internal predecessors, (367), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 16:18:53,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 471 transitions. [2025-03-08 16:18:53,001 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 471 transitions. Word has length 145 [2025-03-08 16:18:53,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:53,001 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 471 transitions. [2025-03-08 16:18:53,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 9.666666666666666) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:18:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 471 transitions. [2025-03-08 16:18:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:18:53,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:53,004 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:53,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 16:18:53,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:53,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:53,006 INFO L85 PathProgramCache]: Analyzing trace with hash -33983833, now seen corresponding path program 1 times [2025-03-08 16:18:53,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:53,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185201127] [2025-03-08 16:18:53,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:53,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:53,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:18:53,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:18:53,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:53,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:53,596 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:53,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:53,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185201127] [2025-03-08 16:18:53,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185201127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:53,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:53,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:18:53,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309751006] [2025-03-08 16:18:53,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:53,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:18:53,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:53,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:18:53,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:18:53,597 INFO L87 Difference]: Start difference. First operand 342 states and 471 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:54,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:54,010 INFO L93 Difference]: Finished difference Result 736 states and 1008 transitions. [2025-03-08 16:18:54,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:18:54,011 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-03-08 16:18:54,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:54,013 INFO L225 Difference]: With dead ends: 736 [2025-03-08 16:18:54,013 INFO L226 Difference]: Without dead ends: 432 [2025-03-08 16:18:54,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:18:54,014 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 242 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:54,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 914 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:18:54,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-03-08 16:18:54,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 321. [2025-03-08 16:18:54,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 274 states have (on average 1.3065693430656935) internal successors, (358), 276 states have internal predecessors, (358), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:18:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 438 transitions. [2025-03-08 16:18:54,048 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 438 transitions. Word has length 146 [2025-03-08 16:18:54,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:54,050 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 438 transitions. [2025-03-08 16:18:54,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:54,050 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 438 transitions. [2025-03-08 16:18:54,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:18:54,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:54,052 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:54,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 16:18:54,052 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:54,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:54,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1830935192, now seen corresponding path program 1 times [2025-03-08 16:18:54,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:54,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063429966] [2025-03-08 16:18:54,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:54,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:18:54,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:18:54,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:54,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:54,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:54,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063429966] [2025-03-08 16:18:54,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063429966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:54,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:54,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:18:54,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401388891] [2025-03-08 16:18:54,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:54,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:18:54,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:54,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:18:54,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:18:54,347 INFO L87 Difference]: Start difference. First operand 321 states and 438 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:54,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:54,525 INFO L93 Difference]: Finished difference Result 875 states and 1195 transitions. [2025-03-08 16:18:54,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:18:54,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-03-08 16:18:54,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:54,528 INFO L225 Difference]: With dead ends: 875 [2025-03-08 16:18:54,529 INFO L226 Difference]: Without dead ends: 557 [2025-03-08 16:18:54,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:18:54,530 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 105 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:54,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 630 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:18:54,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-08 16:18:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 348. [2025-03-08 16:18:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 301 states have (on average 1.2923588039867109) internal successors, (389), 303 states have internal predecessors, (389), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:18:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 469 transitions. [2025-03-08 16:18:54,573 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 469 transitions. Word has length 146 [2025-03-08 16:18:54,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:54,573 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 469 transitions. [2025-03-08 16:18:54,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 469 transitions. [2025-03-08 16:18:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:18:54,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:54,575 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:54,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 16:18:54,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:54,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash -442808058, now seen corresponding path program 1 times [2025-03-08 16:18:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:54,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315432230] [2025-03-08 16:18:54,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:54,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:54,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:18:54,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:18:54,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:54,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:54,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:54,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315432230] [2025-03-08 16:18:54,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315432230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:54,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:54,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:18:54,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925328131] [2025-03-08 16:18:54,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:54,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:18:54,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:54,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:18:54,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:18:54,764 INFO L87 Difference]: Start difference. First operand 348 states and 469 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:54,931 INFO L93 Difference]: Finished difference Result 902 states and 1222 transitions. [2025-03-08 16:18:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:18:54,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-03-08 16:18:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:54,934 INFO L225 Difference]: With dead ends: 902 [2025-03-08 16:18:54,934 INFO L226 Difference]: Without dead ends: 557 [2025-03-08 16:18:54,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:18:54,936 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 103 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:54,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 786 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:18:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-08 16:18:54,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 348. [2025-03-08 16:18:54,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 301 states have (on average 1.2790697674418605) internal successors, (385), 303 states have internal predecessors, (385), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-08 16:18:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 465 transitions. [2025-03-08 16:18:54,965 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 465 transitions. Word has length 146 [2025-03-08 16:18:54,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:54,966 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 465 transitions. [2025-03-08 16:18:54,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:54,966 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 465 transitions. [2025-03-08 16:18:54,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 16:18:54,967 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:54,967 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:54,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 16:18:54,967 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:54,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:54,968 INFO L85 PathProgramCache]: Analyzing trace with hash 2055207879, now seen corresponding path program 1 times [2025-03-08 16:18:54,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:54,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681081593] [2025-03-08 16:18:54,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:54,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 16:18:55,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 16:18:55,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:55,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:55,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:55,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681081593] [2025-03-08 16:18:55,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681081593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:55,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:55,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:18:55,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574526055] [2025-03-08 16:18:55,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:55,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:18:55,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:55,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:18:55,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:18:55,397 INFO L87 Difference]: Start difference. First operand 348 states and 465 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:55,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:55,822 INFO L93 Difference]: Finished difference Result 772 states and 1032 transitions. [2025-03-08 16:18:55,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:18:55,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2025-03-08 16:18:55,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:55,825 INFO L225 Difference]: With dead ends: 772 [2025-03-08 16:18:55,826 INFO L226 Difference]: Without dead ends: 427 [2025-03-08 16:18:55,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:18:55,828 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 205 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:55,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1056 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:18:55,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-08 16:18:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 420. [2025-03-08 16:18:55,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 357 states have (on average 1.2773109243697478) internal successors, (456), 360 states have internal predecessors, (456), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:18:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 564 transitions. [2025-03-08 16:18:55,866 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 564 transitions. Word has length 146 [2025-03-08 16:18:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:55,866 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 564 transitions. [2025-03-08 16:18:55,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 564 transitions. [2025-03-08 16:18:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:18:55,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:55,868 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:55,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 16:18:55,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:55,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash 921047175, now seen corresponding path program 1 times [2025-03-08 16:18:55,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:55,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139499841] [2025-03-08 16:18:55,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:55,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:55,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:18:55,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:18:55,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:55,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:18:56,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:56,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139499841] [2025-03-08 16:18:56,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139499841] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:18:56,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398940044] [2025-03-08 16:18:56,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:56,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:18:56,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:18:56,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:18:56,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 16:18:56,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:18:56,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:18:56,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:56,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:56,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 16:18:56,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:18:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:56,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:18:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398940044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:56,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:18:56,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-03-08 16:18:56,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324302478] [2025-03-08 16:18:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:56,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:18:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:56,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:18:56,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:18:56,237 INFO L87 Difference]: Start difference. First operand 420 states and 564 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:56,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:56,293 INFO L93 Difference]: Finished difference Result 857 states and 1150 transitions. [2025-03-08 16:18:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:18:56,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-08 16:18:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:56,298 INFO L225 Difference]: With dead ends: 857 [2025-03-08 16:18:56,298 INFO L226 Difference]: Without dead ends: 440 [2025-03-08 16:18:56,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:18:56,299 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:56,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 725 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:18:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-03-08 16:18:56,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 434. [2025-03-08 16:18:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 371 states have (on average 1.266846361185984) internal successors, (470), 374 states have internal predecessors, (470), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:18:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 578 transitions. [2025-03-08 16:18:56,330 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 578 transitions. Word has length 147 [2025-03-08 16:18:56,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:56,330 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 578 transitions. [2025-03-08 16:18:56,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:56,330 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 578 transitions. [2025-03-08 16:18:56,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 16:18:56,331 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:56,331 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:56,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 16:18:56,532 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,SelfDestructingSolverStorable11 [2025-03-08 16:18:56,532 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:56,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:56,532 INFO L85 PathProgramCache]: Analyzing trace with hash -191889355, now seen corresponding path program 1 times [2025-03-08 16:18:56,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:56,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394211974] [2025-03-08 16:18:56,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:56,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:56,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:18:56,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:18:56,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:56,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:18:56,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394211974] [2025-03-08 16:18:56,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394211974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:18:56,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324099500] [2025-03-08 16:18:56,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:56,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:18:56,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:18:56,663 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:18:56,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 16:18:56,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 16:18:56,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 16:18:56,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:56,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:56,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:18:56,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:18:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:56,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:18:56,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324099500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:56,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:18:56,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 16:18:56,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116729666] [2025-03-08 16:18:56,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:56,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:18:56,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:56,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:18:56,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:18:56,886 INFO L87 Difference]: Start difference. First operand 434 states and 578 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:56,928 INFO L93 Difference]: Finished difference Result 880 states and 1173 transitions. [2025-03-08 16:18:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:18:56,928 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-03-08 16:18:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:56,930 INFO L225 Difference]: With dead ends: 880 [2025-03-08 16:18:56,930 INFO L226 Difference]: Without dead ends: 449 [2025-03-08 16:18:56,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 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-08 16:18:56,932 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:56,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 576 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:18:56,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-08 16:18:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2025-03-08 16:18:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 386 states have (on average 1.2564766839378239) internal successors, (485), 389 states have internal predecessors, (485), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-08 16:18:56,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 593 transitions. [2025-03-08 16:18:56,961 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 593 transitions. Word has length 147 [2025-03-08 16:18:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:56,961 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 593 transitions. [2025-03-08 16:18:56,961 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:18:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 593 transitions. [2025-03-08 16:18:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:18:56,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:56,962 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:56,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 16:18:57,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:18:57,163 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:57,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:57,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2044752842, now seen corresponding path program 1 times [2025-03-08 16:18:57,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:57,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548068702] [2025-03-08 16:18:57,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:57,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:57,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:18:57,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:18:57,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:57,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:58,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548068702] [2025-03-08 16:18:58,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548068702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:58,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:58,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-08 16:18:58,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464133622] [2025-03-08 16:18:58,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:58,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 16:18:58,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:58,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 16:18:58,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:18:58,056 INFO L87 Difference]: Start difference. First operand 449 states and 593 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:18:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:58,910 INFO L93 Difference]: Finished difference Result 784 states and 1045 transitions. [2025-03-08 16:18:58,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 16:18:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 148 [2025-03-08 16:18:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:58,913 INFO L225 Difference]: With dead ends: 784 [2025-03-08 16:18:58,913 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 16:18:58,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:18:58,914 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 269 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:58,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1254 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:18:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 16:18:58,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 484. [2025-03-08 16:18:58,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 410 states have (on average 1.2560975609756098) internal successors, (515), 413 states have internal predecessors, (515), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 16:18:58,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 643 transitions. [2025-03-08 16:18:58,954 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 643 transitions. Word has length 148 [2025-03-08 16:18:58,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:58,955 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 643 transitions. [2025-03-08 16:18:58,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:18:58,955 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 643 transitions. [2025-03-08 16:18:58,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 16:18:58,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:58,957 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:58,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 16:18:58,957 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:58,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash -161022742, now seen corresponding path program 1 times [2025-03-08 16:18:58,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:18:58,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423737545] [2025-03-08 16:18:58,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:58,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:18:58,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 16:18:59,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 16:18:59,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:59,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:18:59,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:18:59,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423737545] [2025-03-08 16:18:59,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423737545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:18:59,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:18:59,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:18:59,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812947695] [2025-03-08 16:18:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:18:59,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:18:59,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:18:59,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:18:59,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:18:59,715 INFO L87 Difference]: Start difference. First operand 484 states and 643 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:19:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:00,337 INFO L93 Difference]: Finished difference Result 753 states and 997 transitions. [2025-03-08 16:19:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:19:00,338 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 148 [2025-03-08 16:19:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:00,341 INFO L225 Difference]: With dead ends: 753 [2025-03-08 16:19:00,342 INFO L226 Difference]: Without dead ends: 567 [2025-03-08 16:19:00,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:19:00,344 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 110 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:00,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1140 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:19:00,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2025-03-08 16:19:00,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 563. [2025-03-08 16:19:00,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 473 states have (on average 1.2536997885835095) internal successors, (593), 477 states have internal predecessors, (593), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 16:19:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 749 transitions. [2025-03-08 16:19:00,410 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 749 transitions. Word has length 148 [2025-03-08 16:19:00,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:00,410 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 749 transitions. [2025-03-08 16:19:00,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:19:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 749 transitions. [2025-03-08 16:19:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:19:00,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:00,413 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:00,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 16:19:00,413 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:00,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 977311262, now seen corresponding path program 1 times [2025-03-08 16:19:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:00,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355708555] [2025-03-08 16:19:00,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:00,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:00,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:19:00,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:19:00,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:00,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:19:00,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:00,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355708555] [2025-03-08 16:19:00,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355708555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:00,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890683763] [2025-03-08 16:19:00,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:00,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:19:00,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:19:00,578 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-08 16:19:00,581 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-08 16:19:00,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:19:00,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:19:00,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:00,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:00,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:19:00,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:00,890 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:19:00,890 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:19:00,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890683763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:00,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:19:00,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-03-08 16:19:00,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247824657] [2025-03-08 16:19:00,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:00,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:19:00,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:00,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:19:00,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:19:00,893 INFO L87 Difference]: Start difference. First operand 563 states and 749 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:19:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:01,016 INFO L93 Difference]: Finished difference Result 1159 states and 1537 transitions. [2025-03-08 16:19:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:19:01,017 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2025-03-08 16:19:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:01,021 INFO L225 Difference]: With dead ends: 1159 [2025-03-08 16:19:01,022 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 16:19:01,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:19:01,024 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:01,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 865 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:19:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 16:19:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 569. [2025-03-08 16:19:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 479 states have (on average 1.2505219206680585) internal successors, (599), 483 states have internal predecessors, (599), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 16:19:01,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 755 transitions. [2025-03-08 16:19:01,119 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 755 transitions. Word has length 149 [2025-03-08 16:19:01,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:01,120 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 755 transitions. [2025-03-08 16:19:01,120 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:19:01,120 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 755 transitions. [2025-03-08 16:19:01,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:19:01,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:01,122 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:01,131 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-08 16:19:01,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 16:19:01,323 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:01,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:01,324 INFO L85 PathProgramCache]: Analyzing trace with hash 580675000, now seen corresponding path program 1 times [2025-03-08 16:19:01,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:01,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931743993] [2025-03-08 16:19:01,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:01,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:01,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:19:01,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:19:01,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:01,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:19:02,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:02,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931743993] [2025-03-08 16:19:02,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931743993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:02,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:02,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:19:02,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036983106] [2025-03-08 16:19:02,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:02,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:19:02,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:02,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:19:02,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:19:02,105 INFO L87 Difference]: Start difference. First operand 569 states and 755 transitions. Second operand has 9 states, 6 states have (on average 10.333333333333334) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:19:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:02,409 INFO L93 Difference]: Finished difference Result 1382 states and 1835 transitions. [2025-03-08 16:19:02,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:19:02,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 10.333333333333334) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 149 [2025-03-08 16:19:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:02,414 INFO L225 Difference]: With dead ends: 1382 [2025-03-08 16:19:02,415 INFO L226 Difference]: Without dead ends: 816 [2025-03-08 16:19:02,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:19:02,417 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 94 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:02,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1215 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:19:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 816 states. [2025-03-08 16:19:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 816 to 799. [2025-03-08 16:19:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 682 states have (on average 1.2580645161290323) internal successors, (858), 690 states have internal predecessors, (858), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-08 16:19:02,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1058 transitions. [2025-03-08 16:19:02,511 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1058 transitions. Word has length 149 [2025-03-08 16:19:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:02,512 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1058 transitions. [2025-03-08 16:19:02,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 10.333333333333334) internal successors, (62), 9 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:19:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1058 transitions. [2025-03-08 16:19:02,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 16:19:02,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:02,514 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:02,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 16:19:02,515 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:02,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:02,515 INFO L85 PathProgramCache]: Analyzing trace with hash -548475533, now seen corresponding path program 1 times [2025-03-08 16:19:02,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:02,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835522995] [2025-03-08 16:19:02,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:02,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:02,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 16:19:02,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 16:19:02,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:02,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:19:03,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:03,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835522995] [2025-03-08 16:19:03,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835522995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:03,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:03,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:19:03,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917901242] [2025-03-08 16:19:03,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:03,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:19:03,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:03,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:19:03,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:19:03,622 INFO L87 Difference]: Start difference. First operand 799 states and 1058 transitions. Second operand has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:19:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:03,976 INFO L93 Difference]: Finished difference Result 1347 states and 1742 transitions. [2025-03-08 16:19:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:19:03,977 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-03-08 16:19:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:03,981 INFO L225 Difference]: With dead ends: 1347 [2025-03-08 16:19:03,982 INFO L226 Difference]: Without dead ends: 1345 [2025-03-08 16:19:03,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:19:03,983 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 53 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:03,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1041 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:19:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2025-03-08 16:19:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1199. [2025-03-08 16:19:04,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1070 states have (on average 1.253271028037383) internal successors, (1341), 1082 states have internal predecessors, (1341), 108 states have call successors, (108), 20 states have call predecessors, (108), 20 states have return successors, (108), 96 states have call predecessors, (108), 108 states have call successors, (108) [2025-03-08 16:19:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1557 transitions. [2025-03-08 16:19:04,081 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1557 transitions. Word has length 149 [2025-03-08 16:19:04,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:04,081 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1557 transitions. [2025-03-08 16:19:04,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.857142857142858) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:19:04,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1557 transitions. [2025-03-08 16:19:04,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:19:04,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:04,083 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:04,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 16:19:04,084 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:04,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:04,084 INFO L85 PathProgramCache]: Analyzing trace with hash -908481099, now seen corresponding path program 1 times [2025-03-08 16:19:04,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:04,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420437825] [2025-03-08 16:19:04,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:04,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:04,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:19:04,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:19:04,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:04,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:05,436 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:19:05,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:05,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420437825] [2025-03-08 16:19:05,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420437825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:05,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-08 16:19:05,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604018997] [2025-03-08 16:19:05,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:05,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 16:19:05,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:05,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 16:19:05,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:19:05,438 INFO L87 Difference]: Start difference. First operand 1199 states and 1557 transitions. Second operand has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:19:06,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:06,943 INFO L93 Difference]: Finished difference Result 2104 states and 2729 transitions. [2025-03-08 16:19:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 16:19:06,943 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 151 [2025-03-08 16:19:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:06,950 INFO L225 Difference]: With dead ends: 2104 [2025-03-08 16:19:06,950 INFO L226 Difference]: Without dead ends: 1384 [2025-03-08 16:19:06,951 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=166, Invalid=890, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 16:19:06,952 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 657 mSDsluCounter, 2398 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:06,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 2644 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 16:19:06,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-08 16:19:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1356. [2025-03-08 16:19:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1356 states, 1190 states have (on average 1.249579831932773) internal successors, (1487), 1203 states have internal predecessors, (1487), 138 states have call successors, (138), 27 states have call predecessors, (138), 27 states have return successors, (138), 125 states have call predecessors, (138), 138 states have call successors, (138) [2025-03-08 16:19:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 1763 transitions. [2025-03-08 16:19:07,067 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 1763 transitions. Word has length 151 [2025-03-08 16:19:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:07,068 INFO L471 AbstractCegarLoop]: Abstraction has 1356 states and 1763 transitions. [2025-03-08 16:19:07,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:19:07,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 1763 transitions. [2025-03-08 16:19:07,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:19:07,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:07,070 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:07,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 16:19:07,070 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:07,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1381159818, now seen corresponding path program 1 times [2025-03-08 16:19:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:07,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63702140] [2025-03-08 16:19:07,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:07,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:07,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:19:07,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:19:07,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:07,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:19:07,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63702140] [2025-03-08 16:19:07,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63702140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091958634] [2025-03-08 16:19:07,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:07,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:19:07,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:19:07,697 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-08 16:19:07,699 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-08 16:19:07,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:19:07,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:19:07,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:07,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:07,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 16:19:07,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:08,005 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 9 treesize of output 3 [2025-03-08 16:19:08,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:19:08,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 22 [2025-03-08 16:19:08,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 16:19:08,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:08,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 44 [2025-03-08 16:19:08,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:08,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 31 [2025-03-08 16:19:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 24 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-08 16:19:08,695 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:19:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 72 proven. 24 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2025-03-08 16:19:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091958634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:19:09,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:19:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 27 [2025-03-08 16:19:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800353904] [2025-03-08 16:19:09,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:19:09,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-08 16:19:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:09,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-08 16:19:09,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-03-08 16:19:09,068 INFO L87 Difference]: Start difference. First operand 1356 states and 1763 transitions. Second operand has 27 states, 23 states have (on average 6.739130434782608) internal successors, (155), 27 states have internal predecessors, (155), 9 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (54), 5 states have call predecessors, (54), 9 states have call successors, (54) [2025-03-08 16:19:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:10,616 INFO L93 Difference]: Finished difference Result 3212 states and 4148 transitions. [2025-03-08 16:19:10,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 16:19:10,617 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 6.739130434782608) internal successors, (155), 27 states have internal predecessors, (155), 9 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (54), 5 states have call predecessors, (54), 9 states have call successors, (54) Word has length 151 [2025-03-08 16:19:10,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:10,623 INFO L225 Difference]: With dead ends: 3212 [2025-03-08 16:19:10,623 INFO L226 Difference]: Without dead ends: 1898 [2025-03-08 16:19:10,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=381, Invalid=1689, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 16:19:10,626 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 884 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 1846 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:10,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 1846 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 16:19:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2025-03-08 16:19:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1266. [2025-03-08 16:19:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1114 states have (on average 1.248653500897666) internal successors, (1391), 1125 states have internal predecessors, (1391), 122 states have call successors, (122), 29 states have call predecessors, (122), 29 states have return successors, (122), 111 states have call predecessors, (122), 122 states have call successors, (122) [2025-03-08 16:19:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1635 transitions. [2025-03-08 16:19:10,734 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1635 transitions. Word has length 151 [2025-03-08 16:19:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:10,735 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1635 transitions. [2025-03-08 16:19:10,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 6.739130434782608) internal successors, (155), 27 states have internal predecessors, (155), 9 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (54), 5 states have call predecessors, (54), 9 states have call successors, (54) [2025-03-08 16:19:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1635 transitions. [2025-03-08 16:19:10,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-08 16:19:10,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:10,737 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:10,746 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-08 16:19:10,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:19:10,941 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:10,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1371156472, now seen corresponding path program 1 times [2025-03-08 16:19:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:10,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690432668] [2025-03-08 16:19:10,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:10,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:10,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:19:10,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:19:10,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:10,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:19:11,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:11,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690432668] [2025-03-08 16:19:11,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690432668] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:11,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931174997] [2025-03-08 16:19:11,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:11,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:19:11,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:19:11,479 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:19:11,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 16:19:11,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-08 16:19:12,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-08 16:19:12,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:12,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:12,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 16:19:12,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:12,021 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 9 treesize of output 3 [2025-03-08 16:19:12,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 16:19:12,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 16:19:12,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:12,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2025-03-08 16:19:12,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:12,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 19 [2025-03-08 16:19:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-03-08 16:19:12,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:19:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 42 proven. 9 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:19:12,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931174997] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:19:12,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:19:12,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2025-03-08 16:19:12,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914234047] [2025-03-08 16:19:12,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:19:12,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 16:19:12,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:12,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 16:19:12,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2025-03-08 16:19:12,539 INFO L87 Difference]: Start difference. First operand 1266 states and 1635 transitions. Second operand has 24 states, 21 states have (on average 5.9523809523809526) internal successors, (125), 24 states have internal predecessors, (125), 7 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 7 states have call successors, (54) [2025-03-08 16:19:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:13,924 INFO L93 Difference]: Finished difference Result 2842 states and 3655 transitions. [2025-03-08 16:19:13,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 16:19:13,925 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.9523809523809526) internal successors, (125), 24 states have internal predecessors, (125), 7 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 7 states have call successors, (54) Word has length 151 [2025-03-08 16:19:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:13,930 INFO L225 Difference]: With dead ends: 2842 [2025-03-08 16:19:13,930 INFO L226 Difference]: Without dead ends: 1618 [2025-03-08 16:19:13,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=283, Invalid=1277, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 16:19:13,933 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 533 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:13,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 2048 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 16:19:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-03-08 16:19:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1410. [2025-03-08 16:19:14,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1410 states, 1232 states have (on average 1.2475649350649352) internal successors, (1537), 1245 states have internal predecessors, (1537), 142 states have call successors, (142), 35 states have call predecessors, (142), 35 states have return successors, (142), 129 states have call predecessors, (142), 142 states have call successors, (142) [2025-03-08 16:19:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 1821 transitions. [2025-03-08 16:19:14,065 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 1821 transitions. Word has length 151 [2025-03-08 16:19:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:14,065 INFO L471 AbstractCegarLoop]: Abstraction has 1410 states and 1821 transitions. [2025-03-08 16:19:14,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.9523809523809526) internal successors, (125), 24 states have internal predecessors, (125), 7 states have call successors, (54), 3 states have call predecessors, (54), 6 states have return successors, (54), 4 states have call predecessors, (54), 7 states have call successors, (54) [2025-03-08 16:19:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 1821 transitions. [2025-03-08 16:19:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 16:19:14,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:14,067 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:14,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 16:19:14,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:19:14,267 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:14,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:14,268 INFO L85 PathProgramCache]: Analyzing trace with hash 262043216, now seen corresponding path program 1 times [2025-03-08 16:19:14,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:14,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806741160] [2025-03-08 16:19:14,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:14,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:14,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:19:14,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:19:14,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:14,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 15 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:19:14,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:14,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806741160] [2025-03-08 16:19:14,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806741160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:14,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701774817] [2025-03-08 16:19:14,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:14,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:19:14,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:19:14,917 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:19:14,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 16:19:15,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 16:19:15,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 16:19:15,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:15,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:15,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 16:19:15,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:15,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:19:15,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:19:15,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2025-03-08 16:19:15,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:15,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 27 [2025-03-08 16:19:15,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:15,366 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 36 treesize of output 12 [2025-03-08 16:19:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-03-08 16:19:15,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:19:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 16:19:15,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701774817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 16:19:15,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 16:19:15,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 20 [2025-03-08 16:19:15,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415973962] [2025-03-08 16:19:15,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 16:19:15,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:19:15,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:15,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:19:15,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:19:15,622 INFO L87 Difference]: Start difference. First operand 1410 states and 1821 transitions. Second operand has 20 states, 15 states have (on average 9.6) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 4 states have call predecessors, (53), 9 states have call successors, (53) [2025-03-08 16:19:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:16,957 INFO L93 Difference]: Finished difference Result 2662 states and 3387 transitions. [2025-03-08 16:19:16,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 16:19:16,958 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 9.6) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 4 states have call predecessors, (53), 9 states have call successors, (53) Word has length 152 [2025-03-08 16:19:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:16,963 INFO L225 Difference]: With dead ends: 2662 [2025-03-08 16:19:16,963 INFO L226 Difference]: Without dead ends: 1294 [2025-03-08 16:19:16,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 298 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=509, Invalid=2353, Unknown=0, NotChecked=0, Total=2862 [2025-03-08 16:19:16,967 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 553 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:16,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 764 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 16:19:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-03-08 16:19:17,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 928. [2025-03-08 16:19:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 789 states have (on average 1.2129277566539924) internal successors, (957), 794 states have internal predecessors, (957), 106 states have call successors, (106), 32 states have call predecessors, (106), 32 states have return successors, (106), 101 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-08 16:19:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1169 transitions. [2025-03-08 16:19:17,073 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1169 transitions. Word has length 152 [2025-03-08 16:19:17,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:17,074 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1169 transitions. [2025-03-08 16:19:17,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 9.6) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (53), 4 states have call predecessors, (53), 9 states have call successors, (53) [2025-03-08 16:19:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1169 transitions. [2025-03-08 16:19:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 16:19:17,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:17,075 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:17,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 16:19:17,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:19:17,275 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:17,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:17,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1755805832, now seen corresponding path program 1 times [2025-03-08 16:19:17,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:17,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621283108] [2025-03-08 16:19:17,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:17,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:17,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:19:17,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:19:17,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:17,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 87 proven. 48 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-03-08 16:19:17,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621283108] [2025-03-08 16:19:17,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621283108] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:17,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615908476] [2025-03-08 16:19:17,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:17,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:19:17,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:19:17,964 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:19:17,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 16:19:18,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 16:19:18,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 16:19:18,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:18,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:18,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 16:19:18,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:18,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-08 16:19:18,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:18,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 29 [2025-03-08 16:19:18,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:18,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 43 [2025-03-08 16:19:18,618 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 413 proven. 48 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-08 16:19:18,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:19:28,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615908476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:28,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:19:28,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 20 [2025-03-08 16:19:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030230549] [2025-03-08 16:19:28,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:19:28,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 16:19:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:28,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 16:19:28,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=611, Unknown=3, NotChecked=0, Total=756 [2025-03-08 16:19:28,313 INFO L87 Difference]: Start difference. First operand 928 states and 1169 transitions. Second operand has 20 states, 15 states have (on average 6.266666666666667) internal successors, (94), 19 states have internal predecessors, (94), 10 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (27), 6 states have call predecessors, (27), 10 states have call successors, (27) [2025-03-08 16:19:28,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:28,912 INFO L93 Difference]: Finished difference Result 1462 states and 1811 transitions. [2025-03-08 16:19:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 16:19:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 6.266666666666667) internal successors, (94), 19 states have internal predecessors, (94), 10 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (27), 6 states have call predecessors, (27), 10 states have call successors, (27) Word has length 154 [2025-03-08 16:19:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:28,918 INFO L225 Difference]: With dead ends: 1462 [2025-03-08 16:19:28,919 INFO L226 Difference]: Without dead ends: 580 [2025-03-08 16:19:28,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=246, Invalid=1011, Unknown=3, NotChecked=0, Total=1260 [2025-03-08 16:19:28,921 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 277 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:28,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 940 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 16:19:28,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-03-08 16:19:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 328. [2025-03-08 16:19:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 274 states have (on average 1.1897810218978102) internal successors, (326), 274 states have internal predecessors, (326), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:19:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 398 transitions. [2025-03-08 16:19:28,969 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 398 transitions. Word has length 154 [2025-03-08 16:19:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:28,970 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 398 transitions. [2025-03-08 16:19:28,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 6.266666666666667) internal successors, (94), 19 states have internal predecessors, (94), 10 states have call successors, (27), 4 states have call predecessors, (27), 7 states have return successors, (27), 6 states have call predecessors, (27), 10 states have call successors, (27) [2025-03-08 16:19:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 398 transitions. [2025-03-08 16:19:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-08 16:19:28,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:28,971 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:28,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 16:19:29,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-08 16:19:29,175 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:29,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:29,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1251491809, now seen corresponding path program 1 times [2025-03-08 16:19:29,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:29,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502047453] [2025-03-08 16:19:29,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:29,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:29,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-08 16:19:29,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-08 16:19:29,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:29,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:29,902 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:19:29,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:29,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502047453] [2025-03-08 16:19:29,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502047453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:29,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:29,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 16:19:29,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780400498] [2025-03-08 16:19:29,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:29,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 16:19:29,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:29,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 16:19:29,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:19:29,904 INFO L87 Difference]: Start difference. First operand 328 states and 398 transitions. Second operand has 9 states, 6 states have (on average 11.333333333333334) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:19:30,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:30,131 INFO L93 Difference]: Finished difference Result 553 states and 671 transitions. [2025-03-08 16:19:30,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 16:19:30,132 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.333333333333334) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) Word has length 155 [2025-03-08 16:19:30,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:30,133 INFO L225 Difference]: With dead ends: 553 [2025-03-08 16:19:30,133 INFO L226 Difference]: Without dead ends: 328 [2025-03-08 16:19:30,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:19:30,134 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 85 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:30,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 736 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:19:30,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-08 16:19:30,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-08 16:19:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 274 states have (on average 1.1824817518248176) internal successors, (324), 274 states have internal predecessors, (324), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:19:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 396 transitions. [2025-03-08 16:19:30,177 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 396 transitions. Word has length 155 [2025-03-08 16:19:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:30,177 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 396 transitions. [2025-03-08 16:19:30,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.333333333333334) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 4 states have call successors, (18) [2025-03-08 16:19:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 396 transitions. [2025-03-08 16:19:30,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 16:19:30,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:30,178 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:30,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 16:19:30,178 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:30,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:30,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1862718946, now seen corresponding path program 1 times [2025-03-08 16:19:30,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:30,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524504747] [2025-03-08 16:19:30,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:30,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:30,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 16:19:30,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 16:19:30,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:30,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:19:31,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:19:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524504747] [2025-03-08 16:19:31,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524504747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:31,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:31,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-08 16:19:31,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750090098] [2025-03-08 16:19:31,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:31,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 16:19:31,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:19:31,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 16:19:31,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 16:19:31,376 INFO L87 Difference]: Start difference. First operand 328 states and 396 transitions. Second operand has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:19:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:42,733 INFO L93 Difference]: Finished difference Result 656 states and 789 transitions. [2025-03-08 16:19:42,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 16:19:42,733 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) Word has length 157 [2025-03-08 16:19:42,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:42,735 INFO L225 Difference]: With dead ends: 656 [2025-03-08 16:19:42,735 INFO L226 Difference]: Without dead ends: 415 [2025-03-08 16:19:42,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-03-08 16:19:42,736 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 288 mSDsluCounter, 1032 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:42,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1218 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 16:19:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-08 16:19:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 330. [2025-03-08 16:19:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 276 states have (on average 1.173913043478261) internal successors, (324), 276 states have internal predecessors, (324), 36 states have call successors, (36), 17 states have call predecessors, (36), 17 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-08 16:19:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 396 transitions. [2025-03-08 16:19:42,787 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 396 transitions. Word has length 157 [2025-03-08 16:19:42,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:42,787 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 396 transitions. [2025-03-08 16:19:42,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.363636363636363) internal successors, (70), 13 states have internal predecessors, (70), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 16:19:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 396 transitions. [2025-03-08 16:19:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 16:19:42,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:42,788 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:42,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 16:19:42,788 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:42,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1739044498, now seen corresponding path program 1 times [2025-03-08 16:19:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:19:42,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411131390] [2025-03-08 16:19:42,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:19:42,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:19:42,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:19:42,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:42,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:19:42,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:19:42,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 16:19:42,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 16:19:42,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:42,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:19:43,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:19:43,013 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:19:43,014 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:19:43,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 16:19:43,018 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] [2025-03-08 16:19:43,099 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:19:43,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:19:43 BoogieIcfgContainer [2025-03-08 16:19:43,102 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:19:43,103 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:19:43,103 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:19:43,103 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:19:43,104 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:18:44" (3/4) ... [2025-03-08 16:19:43,105 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:19:43,106 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:19:43,106 INFO L158 Benchmark]: Toolchain (without parser) took 59469.23ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 104.9MB in the beginning and 494.8MB in the end (delta: -389.9MB). Peak memory consumption was 62.7MB. Max. memory is 16.1GB. [2025-03-08 16:19:43,107 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:19:43,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.02ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 89.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:19:43,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.89ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 86.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:19:43,107 INFO L158 Benchmark]: Boogie Preprocessor took 61.24ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 81.5MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:19:43,107 INFO L158 Benchmark]: IcfgBuilder took 624.09ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 48.7MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:19:43,108 INFO L158 Benchmark]: TraceAbstraction took 58486.25ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 48.0MB in the beginning and 494.9MB in the end (delta: -447.0MB). Peak memory consumption was 297.6MB. Max. memory is 16.1GB. [2025-03-08 16:19:43,108 INFO L158 Benchmark]: Witness Printer took 2.83ms. Allocated memory is still 595.6MB. Free memory was 494.9MB in the beginning and 494.8MB in the end (delta: 123.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:19:43,109 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.14ms. Allocated memory is still 201.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.02ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 89.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.89ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 86.2MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.24ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 81.5MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 624.09ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 48.7MB in the end (delta: 32.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 58486.25ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 48.0MB in the beginning and 494.9MB in the end (delta: -447.0MB). Peak memory consumption was 297.6MB. Max. memory is 16.1GB. * Witness Printer took 2.83ms. Allocated memory is still 595.6MB. Free memory was 494.9MB in the beginning and 494.8MB in the end (delta: 123.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 0} }; [L25-L27] double double_Array_0[2] = { 256.5, 8.8 }; [L25-L27] double double_Array_0[2] = { 256.5, 8.8 }; [L25-L27] double double_Array_0[2] = { 256.5, 8.8 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L28-L30] unsigned long int unsigned_long_int_Array_0[5] = { 3110219175, 1, 1000000000, 1456677701, 5 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 16, 128 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 16, 128 }; [L31-L33] unsigned short int unsigned_short_int_Array_0[2] = { 16, 128 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L67] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L68] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L70] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L71] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L73] double_Array_0[0] = __VERIFIER_nondet_double() [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L74] EXPR double_Array_0[0] [L74] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+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, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L74] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L75] double_Array_0[1] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L76] EXPR double_Array_0[1] [L76] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+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, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L76] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L77] unsigned_long_int_Array_0[0] = __VERIFIER_nondet_ulong() [L78] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L78] RET assume_abort_if_not(unsigned_long_int_Array_0[0] >= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] EXPR unsigned_long_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] CALL assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L79] RET assume_abort_if_not(unsigned_long_int_Array_0[0] <= 4294967295) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L80] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L81] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L81] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L82] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L83] unsigned_long_int_Array_0[2] = __VERIFIER_nondet_ulong() [L84] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L84] RET assume_abort_if_not(unsigned_long_int_Array_0[2] >= 536870911) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[2] <= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L86] unsigned_long_int_Array_0[3] = __VERIFIER_nondet_ulong() [L87] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L87] RET assume_abort_if_not(unsigned_long_int_Array_0[3] >= 1073741823) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] CALL assume_abort_if_not(unsigned_long_int_Array_0[3] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L88] RET assume_abort_if_not(unsigned_long_int_Array_0[3] <= 2147483647) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L89] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L90] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L104] RET updateVariables() [L105] CALL step() [L37] EXPR BOOL_unsigned_char_Array_0[1][0] [L37] BOOL_unsigned_char_Array_0[1][2] = BOOL_unsigned_char_Array_0[1][0] [L38] EXPR unsigned_long_int_Array_0[1] [L38] EXPR unsigned_long_int_Array_0[0] [L38] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L38] COND TRUE unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2]) [L39] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) [L39] EXPR unsigned_short_int_Array_0[1] [L39] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L39] unsigned_short_int_Array_0[0] = ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))) [L41] EXPR double_Array_0[0] [L41] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L41] COND FALSE !((double_Array_0[0] * 16.5f) > double_Array_0[1]) [L44] EXPR BOOL_unsigned_char_Array_0[0][1] [L44] EXPR BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L44] EXPR BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1] [L44] EXPR BOOL_unsigned_char_Array_0[1][1] [L44] EXPR BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L44] BOOL_unsigned_char_Array_0[0][2] = (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]) [L46] EXPR unsigned_short_int_Array_0[0] [L46] EXPR unsigned_long_int_Array_0[3] [L46] EXPR unsigned_long_int_Array_0[2] [L46] EXPR unsigned_short_int_Array_0[0] [L46] unsigned_long_int_Array_0[4] = (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))) [L47] EXPR unsigned_short_int_Array_0[0] [L47] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L47] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L47] EXPR unsigned_short_int_Array_0[0] [L47] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L47] signed long int stepLocal_1 = (((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0])); [L48] EXPR unsigned_long_int_Array_0[3] [L48] unsigned long int stepLocal_0 = unsigned_long_int_Array_0[3]; [L49] EXPR unsigned_long_int_Array_0[2] [L49] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L49] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) [L49] EXPR unsigned_long_int_Array_0[2] [L49] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, stepLocal_0=-3221225472, stepLocal_1=65534, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L49] COND TRUE stepLocal_1 != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]))) [L50] EXPR double_Array_0[0] [L50] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L50] COND FALSE !(double_Array_0[0] == double_Array_0[1]) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR unsigned_long_int_Array_0[4] [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR unsigned_long_int_Array_0[3] [L96] EXPR unsigned_long_int_Array_0[2] [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR (unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) [L96] EXPR BOOL_unsigned_char_Array_0[1][2] [L96] EXPR BOOL_unsigned_char_Array_0[1][0] [L96] EXPR (unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR ((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR unsigned_long_int_Array_0[2] [L96] EXPR unsigned_long_int_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) [L96] EXPR unsigned_long_int_Array_0[2] [L96] EXPR ((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) [L96] EXPR double_Array_0[0] [L96] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 [L96] EXPR (double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1) [L96] EXPR unsigned_long_int_Array_0[1] [L96] EXPR unsigned_long_int_Array_0[0] [L96] EXPR unsigned_long_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1 [L96] EXPR unsigned_short_int_Array_0[0] [L96] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) [L96] EXPR unsigned_short_int_Array_0[1] [L96] EXPR ((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR (((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) [L96] EXPR double_Array_0[0] [L96] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) [L96] EXPR BOOL_unsigned_char_Array_0[0][2] [L96] EXPR BOOL_unsigned_char_Array_0[0][1] [L96] EXPR ((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96] EXPR ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L96-L97] return ((((unsigned_long_int_Array_0[4] == ((unsigned long int) (unsigned_short_int_Array_0[0] + (unsigned_long_int_Array_0[3] - (unsigned_long_int_Array_0[2] - unsigned_short_int_Array_0[0]))))) && (BOOL_unsigned_char_Array_0[1][2] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) && ((((((unsigned_short_int_Array_0[0]) < (unsigned_short_int_Array_0[0])) ? (unsigned_short_int_Array_0[0]) : (unsigned_short_int_Array_0[0]))) != ((((unsigned_long_int_Array_0[2]) < (unsigned_long_int_Array_0[3])) ? (unsigned_long_int_Array_0[2]) : (unsigned_long_int_Array_0[3])))) ? ((double_Array_0[0] == double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[1][2] ? ((unsigned_long_int_Array_0[3] >= unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0]))) : 1) : 1) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[0][1])))) && ((unsigned_long_int_Array_0[1] <= (unsigned_long_int_Array_0[0] - unsigned_long_int_Array_0[2])) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((((unsigned_short_int_Array_0[1]) < 0 ) ? -(unsigned_short_int_Array_0[1]) : (unsigned_short_int_Array_0[1]))))) : 1)) && (((double_Array_0[0] * 16.5f) > double_Array_0[1]) ? (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (! BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[0][2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0][1] && BOOL_unsigned_char_Array_0[1][1])))) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, unsigned_long_int_Array_0={6:0}, unsigned_short_int_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 111 locations, 180 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.4s, OverallIterations: 26, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5089 SdHoareTripleChecker+Valid, 8.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4979 mSDsluCounter, 24823 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20892 mSDsCounter, 889 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11381 IncrementalHoareTripleChecker+Invalid, 12270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 889 mSolverCounterUnsat, 3931 mSDtfsCounter, 11381 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2162 GetRequests, 1791 SyntacticMatches, 9 SemanticMatches, 362 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2054 ImplicationChecksByTransitivity, 24.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1410occurred in iteration=21, InterpolantAutomatonStates: 300, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 2436 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 28.0s InterpolantComputationTime, 5033 NumberOfCodeBlocks, 5033 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5293 ConstructedInterpolants, 0 QuantifiedInterpolants, 25580 SizeOfPredicates, 24 NumberOfNonLiveVariables, 4164 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 36 InterpolantComputations, 21 PerfectInterpolantSequences, 21548/22032 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:19:43,166 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-53.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 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:19:44,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:19:45,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:19:45,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:19:45,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:19:45,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:19:45,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:19:45,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:19:45,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:19:45,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:19:45,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:19:45,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:19:45,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:19:45,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:19:45,048 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:19:45,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:19:45,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:19:45,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:19:45,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:19:45,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:19:45,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:19:45,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:19:45,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:19:45,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:19:45,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:19:45,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:19:45,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:19:45,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:19:45,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:19:45,051 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:19:45,051 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:19:45,051 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:19:45,051 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:19:45,051 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:19:45,051 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:19:45,052 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 -> 1b5fc557e9eca50427a2e44f543168d77b97544575eea34c071efc5d55e33518 [2025-03-08 16:19:45,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:19:45,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:19:45,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:19:45,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:19:45,309 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:19:45,310 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-53.i [2025-03-08 16:19:46,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce4b15de/48baa2ac55814fae81bb2f3e2e19d5c3/FLAG328b0d30f [2025-03-08 16:19:46,655 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:19:46,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-53.i [2025-03-08 16:19:46,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce4b15de/48baa2ac55814fae81bb2f3e2e19d5c3/FLAG328b0d30f [2025-03-08 16:19:47,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce4b15de/48baa2ac55814fae81bb2f3e2e19d5c3 [2025-03-08 16:19:47,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:19:47,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:19:47,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:19:47,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:19:47,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:19:47,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c7b5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47, skipping insertion in model container [2025-03-08 16:19:47,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,040 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:19:47,133 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-53.i[916,929] [2025-03-08 16:19:47,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:19:47,183 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:19:47,191 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-53.i[916,929] [2025-03-08 16:19:47,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:19:47,242 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:19:47,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47 WrapperNode [2025-03-08 16:19:47,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:19:47,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:19:47,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:19:47,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:19:47,247 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,284 INFO L138 Inliner]: procedures = 36, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2025-03-08 16:19:47,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:19:47,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:19:47,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:19:47,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:19:47,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,319 INFO L175 MemorySlicer]: Split 133 memory accesses to 5 slices as follows [2, 45, 20, 39, 27]. 34 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 2, 5, 2]. The 18 writes are split as follows [0, 9, 2, 5, 2]. [2025-03-08 16:19:47,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:19:47,365 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:19:47,365 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:19:47,365 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:19:47,366 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (1/1) ... [2025-03-08 16:19:47,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:19:47,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:19:47,390 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:19:47,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:19:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:19:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:19:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:19:47,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:19:47,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:19:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-08 16:19:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-08 16:19:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-08 16:19:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-08 16:19:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-08 16:19:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:19:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:19:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:19:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:19:47,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-08 16:19:47,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:19:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:19:47,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:19:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:19:47,538 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:19:47,539 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:19:48,304 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem88#1;havoc property_#t~mem87#1;havoc property_#t~short89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~ite94#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~ite116#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~ite113#1;havoc property_#t~mem102#1;havoc property_#t~ite112#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~ite111#1;havoc property_#t~mem108#1;havoc property_#t~mem105#1;havoc property_#t~mem106#1;havoc property_#t~short107#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short117#1;havoc property_#t~mem120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem121#1;havoc property_#t~ite124#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~ite136#1;havoc property_#t~mem131#1;havoc property_#t~mem130#1;havoc property_#t~mem135#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short134#1;havoc property_#t~short137#1; [2025-03-08 16:19:48,339 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-03-08 16:19:48,339 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:19:48,350 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:19:48,351 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:19:48,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:19:48 BoogieIcfgContainer [2025-03-08 16:19:48,352 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:19:48,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:19:48,353 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:19:48,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:19:48,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:19:47" (1/3) ... [2025-03-08 16:19:48,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c2da9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:19:48, skipping insertion in model container [2025-03-08 16:19:48,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:19:47" (2/3) ... [2025-03-08 16:19:48,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c2da9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:19:48, skipping insertion in model container [2025-03-08 16:19:48,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:19:48" (3/3) ... [2025-03-08 16:19:48,359 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-53.i [2025-03-08 16:19:48,369 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:19:48,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-53.i that has 2 procedures, 111 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:19:48,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:19:48,414 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;@139fcfad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:19:48,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:19:48,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:19:48,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:19:48,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:48,425 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:48,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:48,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:48,429 INFO L85 PathProgramCache]: Analyzing trace with hash 863806641, now seen corresponding path program 1 times [2025-03-08 16:19:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:19:48,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405957489] [2025-03-08 16:19:48,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:48,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:19:48,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:19:48,446 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:19:48,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:19:48,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:19:48,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:19:48,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:48,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:48,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:19:48,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-08 16:19:48,800 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:19:48,801 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:19:48,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405957489] [2025-03-08 16:19:48,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405957489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:48,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:48,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:19:48,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780383145] [2025-03-08 16:19:48,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:48,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:19:48,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:19:48,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:19:48,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:19:48,825 INFO L87 Difference]: Start difference. First operand has 111 states, 90 states have (on average 1.4) internal successors, (126), 91 states have internal predecessors, (126), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:19:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:48,847 INFO L93 Difference]: Finished difference Result 216 states and 337 transitions. [2025-03-08 16:19:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:19:48,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 140 [2025-03-08 16:19:48,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:48,856 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:19:48,856 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:19:48,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:19:48,860 INFO L435 NwaCegarLoop]: 155 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, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:48,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:19:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:19:48,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:19:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:19:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 155 transitions. [2025-03-08 16:19:48,901 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 155 transitions. Word has length 140 [2025-03-08 16:19:48,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:48,901 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 155 transitions. [2025-03-08 16:19:48,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 16:19:48,901 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 155 transitions. [2025-03-08 16:19:48,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:19:48,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:48,905 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:48,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:19:49,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:19:49,106 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:49,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:49,106 INFO L85 PathProgramCache]: Analyzing trace with hash -992856479, now seen corresponding path program 1 times [2025-03-08 16:19:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:19:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076498364] [2025-03-08 16:19:49,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:49,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:19:49,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:19:49,109 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:19:49,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:19:49,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:19:49,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:19:49,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:49,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:49,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 16:19:49,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:49,549 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-08 16:19:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 16:19:49,579 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:19:49,579 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:19:49,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076498364] [2025-03-08 16:19:49,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076498364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:19:49,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:19:49,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:19:49,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5044625] [2025-03-08 16:19:49,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:19:49,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:19:49,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:19:49,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:19:49,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:19:49,581 INFO L87 Difference]: Start difference. First operand 108 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:19:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:49,615 INFO L93 Difference]: Finished difference Result 213 states and 307 transitions. [2025-03-08 16:19:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:19:49,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2025-03-08 16:19:49,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:49,620 INFO L225 Difference]: With dead ends: 213 [2025-03-08 16:19:49,621 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:19:49,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:19:49,623 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:49,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:19:49,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:19:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:19:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 16:19:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 154 transitions. [2025-03-08 16:19:49,629 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 154 transitions. Word has length 140 [2025-03-08 16:19:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 154 transitions. [2025-03-08 16:19:49,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 16:19:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 154 transitions. [2025-03-08 16:19:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:19:49,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:49,632 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:49,641 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 (3)] Forceful destruction successful, exit code 0 [2025-03-08 16:19:49,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:19:49,833 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:49,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1503390656, now seen corresponding path program 1 times [2025-03-08 16:19:49,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:19:49,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104666592] [2025-03-08 16:19:49,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:49,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:19:49,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:19:49,836 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:19:49,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:19:49,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:19:50,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:19:50,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:50,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:50,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-08 16:19:50,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:50,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:19:50,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-03-08 16:19:50,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:50,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 53 [2025-03-08 16:19:50,549 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 40 treesize of output 32 [2025-03-08 16:19:50,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:50,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 24 [2025-03-08 16:19:50,859 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 24 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-08 16:19:50,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:19:51,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:19:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104666592] [2025-03-08 16:19:51,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104666592] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:51,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [131920570] [2025-03-08 16:19:51,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:51,075 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:19:51,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:19:51,077 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:19:51,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-08 16:19:51,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:19:51,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:19:51,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:51,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:51,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 16:19:51,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:52,010 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 15 treesize of output 1 [2025-03-08 16:19:52,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-08 16:19:52,603 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 38 treesize of output 30 [2025-03-08 16:19:52,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:52,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39 [2025-03-08 16:19:52,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:52,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 24 [2025-03-08 16:19:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 288 proven. 24 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-03-08 16:19:52,998 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:19:53,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [131920570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:53,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 16:19:53,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2025-03-08 16:19:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921544488] [2025-03-08 16:19:53,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 16:19:53,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 16:19:53,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:19:53,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 16:19:53,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:19:53,110 INFO L87 Difference]: Start difference. First operand 108 states and 154 transitions. Second operand has 26 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-08 16:19:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:19:55,945 INFO L93 Difference]: Finished difference Result 266 states and 374 transitions. [2025-03-08 16:19:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 16:19:55,945 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) Word has length 140 [2025-03-08 16:19:55,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:19:55,948 INFO L225 Difference]: With dead ends: 266 [2025-03-08 16:19:55,948 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 16:19:55,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 295 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=270, Invalid=1212, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 16:19:55,954 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 623 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:19:55,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1536 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 16:19:55,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 16:19:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 156. [2025-03-08 16:19:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 122 states have internal predecessors, (157), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 16:19:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 217 transitions. [2025-03-08 16:19:55,978 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 217 transitions. Word has length 140 [2025-03-08 16:19:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:19:55,979 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 217 transitions. [2025-03-08 16:19:55,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 5.045454545454546) internal successors, (111), 24 states have internal predecessors, (111), 8 states have call successors, (36), 6 states have call predecessors, (36), 8 states have return successors, (36), 6 states have call predecessors, (36), 8 states have call successors, (36) [2025-03-08 16:19:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 217 transitions. [2025-03-08 16:19:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 16:19:55,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:19:55,983 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:19:55,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 16:19:56,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-08 16:19:56,384 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-08 16:19:56,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:19:56,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:19:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2008949281, now seen corresponding path program 1 times [2025-03-08 16:19:56,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:19:56,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865822916] [2025-03-08 16:19:56,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:56,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:19:56,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:19:56,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:19:56,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:19:56,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:19:56,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:19:56,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:56,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:56,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 16:19:56,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:56,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:19:56,879 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 44 treesize of output 36 [2025-03-08 16:19:56,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:56,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 45 [2025-03-08 16:19:57,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:57,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 24 [2025-03-08 16:19:57,150 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 218 proven. 12 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-03-08 16:19:57,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:19:57,290 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:19:57,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865822916] [2025-03-08 16:19:57,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1865822916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:19:57,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1682893678] [2025-03-08 16:19:57,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:19:57,291 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-08 16:19:57,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-08 16:19:57,293 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-08 16:19:57,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-08 16:19:57,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 16:19:58,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 16:19:58,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:19:58,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:19:58,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 16:19:58,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:19:58,181 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 15 treesize of output 1 [2025-03-08 16:19:58,596 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 38 treesize of output 30 [2025-03-08 16:19:58,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:19:58,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39