./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.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-41.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 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:16:58,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:16:58,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:16:58,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:16:58,873 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:16:58,893 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:16:58,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:16:58,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:16:58,894 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:16:58,894 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:16:58,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:16:58,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:16:58,894 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:16:58,894 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:16:58,894 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:16:58,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:16:58,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:16:58,895 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:16:58,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:16:58,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:16:58,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:16:58,899 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:16:58,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:16:58,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:16:58,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:16:58,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:16:58,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:16:58,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:16:58,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:16:58,899 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 -> 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 [2025-03-08 16:16:59,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:16:59,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:16:59,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:16:59,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:16:59,137 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:16:59,138 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-41.i [2025-03-08 16:17:00,288 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51b73458/a861afba412e48c9859febfd43379c2a/FLAGe14b2cf3a [2025-03-08 16:17:00,533 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:17:00,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i [2025-03-08 16:17:00,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51b73458/a861afba412e48c9859febfd43379c2a/FLAGe14b2cf3a [2025-03-08 16:17:00,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51b73458/a861afba412e48c9859febfd43379c2a [2025-03-08 16:17:00,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:17:00,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:17:00,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:17:00,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:17:00,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:17:00,859 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:17:00" (1/1) ... [2025-03-08 16:17:00,860 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537c6340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:00, skipping insertion in model container [2025-03-08 16:17:00,860 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:17:00" (1/1) ... [2025-03-08 16:17:00,872 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:17:00,964 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-41.i[916,929] [2025-03-08 16:17:01,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:17:01,011 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:17:01,019 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-41.i[916,929] [2025-03-08 16:17:01,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:17:01,062 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:17:01,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01 WrapperNode [2025-03-08 16:17:01,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:17:01,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:17:01,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:17:01,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:17:01,069 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:17:01" (1/1) ... [2025-03-08 16:17:01,078 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:17:01" (1/1) ... [2025-03-08 16:17:01,103 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2025-03-08 16:17:01,104 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:17:01,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:17:01,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:17:01,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:17:01,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (1/1) ... [2025-03-08 16:17:01,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (1/1) ... [2025-03-08 16:17:01,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (1/1) ... [2025-03-08 16:17:01,148 INFO L175 MemorySlicer]: Split 111 memory accesses to 7 slices as follows [2, 18, 15, 35, 7, 23, 11]. 32 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 2, 4, 1, 2, 1]. The 17 writes are split as follows [0, 2, 2, 6, 2, 2, 3]. [2025-03-08 16:17:01,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (1/1) ... [2025-03-08 16:17:01,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (1/1) ... [2025-03-08 16:17:01,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (1/1) ... [2025-03-08 16:17:01,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (1/1) ... [2025-03-08 16:17:01,161 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (1/1) ... [2025-03-08 16:17:01,162 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (1/1) ... [2025-03-08 16:17:01,165 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:17:01,166 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:17:01,166 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:17:01,166 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:17:01,167 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (1/1) ... [2025-03-08 16:17:01,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:17:01,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:17:01,196 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:17:01,199 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:17:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:17:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-08 16:17:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-08 16:17:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-08 16:17:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-08 16:17:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-08 16:17:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-08 16:17:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-08 16:17:01,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 16:17:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 16:17:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 16:17:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 16:17:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 16:17:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 16:17:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 16:17:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-08 16:17:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-08 16:17:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-08 16:17:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-08 16:17:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-08 16:17:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-08 16:17:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-08 16:17:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 16:17:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 16:17:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 16:17:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 16:17:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 16:17:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 16:17:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 16:17:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-08 16:17:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-08 16:17:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-08 16:17:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-08 16:17:01,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-08 16:17:01,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-08 16:17:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-08 16:17:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:17:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:17:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:17:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 16:17:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 16:17:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 16:17:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 16:17:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 16:17:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 16:17:01,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:17:01,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:17:01,337 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:17:01,338 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:17:01,664 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite75#1;havoc property_#t~mem63#1;havoc property_#t~ite72#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite89#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-03-08 16:17:01,701 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-03-08 16:17:01,701 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:17:01,712 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:17:01,712 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:17:01,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:17:01 BoogieIcfgContainer [2025-03-08 16:17:01,713 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:17:01,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:17:01,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:17:01,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:17:01,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:17:00" (1/3) ... [2025-03-08 16:17:01,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d44a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:17:01, skipping insertion in model container [2025-03-08 16:17:01,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:01" (2/3) ... [2025-03-08 16:17:01,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d44a47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:17:01, skipping insertion in model container [2025-03-08 16:17:01,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:17:01" (3/3) ... [2025-03-08 16:17:01,721 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-41.i [2025-03-08 16:17:01,733 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:17:01,735 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-41.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:17:01,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:17:01,788 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;@7b4b8d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:17:01,788 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:17:01,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:17:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 16:17:01,798 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:01,798 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:01,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:01,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:01,802 INFO L85 PathProgramCache]: Analyzing trace with hash 134934688, now seen corresponding path program 1 times [2025-03-08 16:17:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:17:01,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169305836] [2025-03-08 16:17:01,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:17:01,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 16:17:01,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 16:17:01,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:01,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:02,056 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 16:17:02,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:17:02,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169305836] [2025-03-08 16:17:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169305836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476999387] [2025-03-08 16:17:02,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:02,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:17:02,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:17:02,061 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:17:02,063 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:17:02,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 16:17:02,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 16:17:02,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:02,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:02,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:17:02,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 16:17:02,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:02,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476999387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:02,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:17:02,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:17:02,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416541488] [2025-03-08 16:17:02,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:02,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:17:02,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:17:02,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:17:02,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:17:02,370 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:17:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:02,394 INFO L93 Difference]: Finished difference Result 166 states and 257 transitions. [2025-03-08 16:17:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:17:02,396 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-08 16:17:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:02,401 INFO L225 Difference]: With dead ends: 166 [2025-03-08 16:17:02,402 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 16:17:02,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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:17:02,408 INFO L435 NwaCegarLoop]: 115 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, 115 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:17:02,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:02,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 16:17:02,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 16:17:02,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:17:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-03-08 16:17:02,447 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2025-03-08 16:17:02,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:02,447 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-03-08 16:17:02,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:17:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-03-08 16:17:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 16:17:02,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:02,453 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:02,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:17:02,654 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:17:02,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:02,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:02,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2093516058, now seen corresponding path program 1 times [2025-03-08 16:17:02,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:17:02,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476771311] [2025-03-08 16:17:02,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:02,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:17:02,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 16:17:02,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 16:17:02,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:02,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:17:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:17:03,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476771311] [2025-03-08 16:17:03,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476771311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:03,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:03,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:17:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226691198] [2025-03-08 16:17:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:03,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:17:03,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:17:03,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:17:03,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:17:03,416 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:17:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:03,550 INFO L93 Difference]: Finished difference Result 216 states and 306 transitions. [2025-03-08 16:17:03,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:17:03,551 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-03-08 16:17:03,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:03,552 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:17:03,552 INFO L226 Difference]: Without dead ends: 138 [2025-03-08 16:17:03,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:17:03,553 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 74 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:03,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 593 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:17:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-08 16:17:03,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-03-08 16:17:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 109 states have internal predecessors, (143), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:17:03,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 191 transitions. [2025-03-08 16:17:03,580 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 191 transitions. Word has length 114 [2025-03-08 16:17:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:03,580 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 191 transitions. [2025-03-08 16:17:03,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:17:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 191 transitions. [2025-03-08 16:17:03,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 16:17:03,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:03,583 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:03,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:17:03,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:03,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:03,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1138485557, now seen corresponding path program 1 times [2025-03-08 16:17:03,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:17:03,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016436796] [2025-03-08 16:17:03,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:03,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:17:03,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 16:17:03,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 16:17:03,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:03,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:03,811 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:17:03,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:17:03,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016436796] [2025-03-08 16:17:03,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016436796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:03,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:03,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:17:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445777496] [2025-03-08 16:17:03,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:03,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:17:03,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:17:03,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:17:03,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:17:03,814 INFO L87 Difference]: Start difference. First operand 135 states and 191 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:17:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:03,835 INFO L93 Difference]: Finished difference Result 240 states and 339 transitions. [2025-03-08 16:17:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:17:03,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-03-08 16:17:03,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:03,839 INFO L225 Difference]: With dead ends: 240 [2025-03-08 16:17:03,840 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:17:03,840 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:17:03,843 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:03,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:17:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:17:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 82 states have internal predecessors, (102), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:17:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 150 transitions. [2025-03-08 16:17:03,859 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 150 transitions. Word has length 115 [2025-03-08 16:17:03,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:03,860 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 150 transitions. [2025-03-08 16:17:03,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:17:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 150 transitions. [2025-03-08 16:17:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:17:03,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:03,862 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:03,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:17:03,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:03,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:03,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1106924536, now seen corresponding path program 1 times [2025-03-08 16:17:03,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:17:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18445479] [2025-03-08 16:17:03,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:03,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:17:03,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:17:03,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:17:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:04,783 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:17:04,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:17:04,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18445479] [2025-03-08 16:17:04,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18445479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:04,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:04,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:17:04,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238925599] [2025-03-08 16:17:04,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:04,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:17:04,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:17:04,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:17:04,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:17:04,788 INFO L87 Difference]: Start difference. First operand 108 states and 150 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:17:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:05,026 INFO L93 Difference]: Finished difference Result 269 states and 370 transitions. [2025-03-08 16:17:05,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:17:05,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 116 [2025-03-08 16:17:05,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:05,028 INFO L225 Difference]: With dead ends: 269 [2025-03-08 16:17:05,029 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 16:17:05,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-08 16:17:05,030 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 96 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:05,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 818 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 16:17:05,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 16:17:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 179. [2025-03-08 16:17:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.25) internal successors, (170), 138 states have internal predecessors, (170), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:17:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 246 transitions. [2025-03-08 16:17:05,051 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 246 transitions. Word has length 116 [2025-03-08 16:17:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:05,051 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 246 transitions. [2025-03-08 16:17:05,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:17:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 246 transitions. [2025-03-08 16:17:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:17:05,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:05,053 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:05,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:17:05,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:05,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:05,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1380588297, now seen corresponding path program 1 times [2025-03-08 16:17:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:17:05,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020190193] [2025-03-08 16:17:05,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:05,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:17:05,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:17:05,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:17:05,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:05,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:17:05,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:17:05,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:17:05,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:17:05,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:05,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:17:05,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:17:05,235 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:17:05,236 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:17:05,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 16:17:05,239 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 16:17:05,314 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:17:05,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:17:05 BoogieIcfgContainer [2025-03-08 16:17:05,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:17:05,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:17:05,322 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:17:05,322 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:17:05,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:17:01" (3/4) ... [2025-03-08 16:17:05,324 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:17:05,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:17:05,325 INFO L158 Benchmark]: Toolchain (without parser) took 4470.14ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 129.4MB in the beginning and 149.0MB in the end (delta: -19.7MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2025-03-08 16:17:05,325 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 192.9MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:17:05,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.33ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 114.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:17:05,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.97ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 111.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:17:05,326 INFO L158 Benchmark]: Boogie Preprocessor took 61.00ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 107.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:17:05,326 INFO L158 Benchmark]: IcfgBuilder took 546.80ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 77.8MB in the end (delta: 29.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:17:05,327 INFO L158 Benchmark]: TraceAbstraction took 3607.05ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 77.3MB in the beginning and 149.1MB in the end (delta: -71.8MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2025-03-08 16:17:05,327 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 201.3MB. Free memory was 149.1MB in the beginning and 149.0MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:17:05,328 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.19ms. Allocated memory is still 192.9MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.33ms. Allocated memory is still 167.8MB. Free memory was 129.1MB in the beginning and 114.4MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.97ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 111.4MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.00ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 107.2MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 546.80ms. Allocated memory is still 167.8MB. Free memory was 107.2MB in the beginning and 77.8MB in the end (delta: 29.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3607.05ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 77.3MB in the beginning and 149.1MB in the end (delta: -71.8MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 201.3MB. Free memory was 149.1MB in the beginning and 149.0MB in the end (delta: 39.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 8.5, 999999999999.6 }; [L25-L27] double double_Array_0[2] = { 8.5, 999999999999.6 }; [L25-L27] double double_Array_0[2] = { 8.5, 999999999999.6 }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L28-L30] signed char signed_char_Array_0[2][2] = { {5, -8}, {-1, -16} }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 10 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 10 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 64 }; [L34-L36] unsigned char unsigned_char_Array_0[2] = { 16, 64 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 2 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 2 }; [L40] signed char last_1_signed_char_Array_0_1__1_ = -16; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=0, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] EXPR signed_char_Array_0[1][1] [L98] last_1_signed_char_Array_0_1__1_ = signed_char_Array_0[1][1] [L108] RET updateLastVariables() [L109] CALL updateVariables() [L75] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] double_Array_0[1] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F [L82] EXPR double_Array_0[1] [L82] EXPR double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] EXPR (double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[1] >= 0.0F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L84] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[0][0] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L87] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1][0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1][0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L91] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -31) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L93] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L94] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L94] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L109] RET updateVariables() [L110] CALL step() [L44] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] COND TRUE BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_) [L45] EXPR unsigned_char_Array_0[1] [L45] unsigned_char_Array_0[0] = unsigned_char_Array_0[1] [L47] EXPR double_Array_0[1] [L47] double_Array_0[0] = (double_Array_0[1] - 8.3) [L48] EXPR double_Array_0[1] [L48] EXPR double_Array_0[0] [L48] unsigned char stepLocal_1 = double_Array_0[1] >= double_Array_0[0]; [L49] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L49] COND TRUE BOOL_unsigned_char_Array_0[1] && stepLocal_1 [L50] EXPR unsigned_char_Array_0[0] [L50] signed_long_int_Array_0[0] = unsigned_char_Array_0[0] [L54] BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L54] COND TRUE BOOL_unsigned_char_Array_0[1] [L55] EXPR unsigned_char_Array_0[0] [L55] EXPR unsigned_char_Array_0[0] [L55] unsigned_short_int_Array_0[0] = (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]) [L63] EXPR unsigned_short_int_Array_0[0] [L63] EXPR unsigned_char_Array_0[0] [L63] unsigned long int stepLocal_0 = (unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]; [L64] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND FALSE !(stepLocal_0 > unsigned_short_int_Array_0[0]) [L71] EXPR signed_char_Array_0[0][1] [L71] signed_char_Array_0[1][1] = signed_char_Array_0[0][1] [L110] RET step() [L111] CALL, EXPR property() [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) [L101] EXPR signed_char_Array_0[1][1] [L101] EXPR signed_char_Array_0[0][1] [L101] EXPR (((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])))) [L101] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))) [L101] EXPR unsigned_short_int_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR unsigned_char_Array_0[0] [L101] EXPR BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3))) [L101] EXPR double_Array_0[0] [L101] EXPR double_Array_0[1] [L101] EXPR (((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR ((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])))) && ((BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_)) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101] EXPR (((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])))) && ((BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_)) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L101-L102] return (((((((unsigned_short_int_Array_0[0] & 0u) * unsigned_char_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[1] ? (signed_char_Array_0[1][1] == ((signed char) ((16 + signed_char_Array_0[0][1]) + signed_char_Array_0[0][0]))) : (signed_char_Array_0[1][1] == ((signed char) ((((signed_char_Array_0[0][1]) < 0 ) ? -(signed_char_Array_0[0][1]) : (signed_char_Array_0[0][1])))))) : (signed_char_Array_0[1][1] == ((signed char) signed_char_Array_0[0][1]))) && (BOOL_unsigned_char_Array_0[1] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (unsigned_char_Array_0[0] + unsigned_char_Array_0[0]))) : (((unsigned_char_Array_0[0] > signed_long_int_Array_0[0]) || BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[0]))))) && (double_Array_0[0] == ((double) (double_Array_0[1] - 8.3)))) && ((BOOL_unsigned_char_Array_0[1] && (double_Array_0[1] >= double_Array_0[0])) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])))) && ((BOOL_unsigned_char_Array_0[1] && (last_1_signed_char_Array_0_1__1_ <= last_1_signed_char_Array_0_1__1_)) ? (unsigned_char_Array_0[0] == ((unsigned char) unsigned_char_Array_0[1])) : 1) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_signed_char_Array_0_1__1_=-16, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, unsigned_char_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 141 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 1737 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1188 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 244 IncrementalHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 549 mSDtfsCounter, 244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 414 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1794/1820 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:17:05,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-41.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 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:17:07,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:17:07,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:17:07,276 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:17:07,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:17:07,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:17:07,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:17:07,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:17:07,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:17:07,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:17:07,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:17:07,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:17:07,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:17:07,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:17:07,306 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:17:07,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:17:07,307 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:17:07,308 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:17:07,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:17:07,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:17:07,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:17:07,309 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:17:07,309 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:17:07,309 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:17:07,309 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:17:07,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:17:07,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:17:07,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:17:07,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:17:07,309 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 -> 5500c8c7193dc6037ea6a3bb34476f6fde8daaea8a8ab7a630cc148614b2e159 [2025-03-08 16:17:07,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:17:07,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:17:07,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:17:07,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:17:07,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:17:07,603 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-41.i [2025-03-08 16:17:08,717 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fd89c95/79ddbaeb42f144688146217113a3a050/FLAGcd4340d99 [2025-03-08 16:17:08,865 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:17:08,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-41.i [2025-03-08 16:17:08,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fd89c95/79ddbaeb42f144688146217113a3a050/FLAGcd4340d99 [2025-03-08 16:17:09,267 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38fd89c95/79ddbaeb42f144688146217113a3a050 [2025-03-08 16:17:09,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:17:09,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:17:09,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:17:09,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:17:09,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:17:09,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ed13e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09, skipping insertion in model container [2025-03-08 16:17:09,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:17:09,383 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-41.i[916,929] [2025-03-08 16:17:09,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:17:09,438 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:17:09,446 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-41.i[916,929] [2025-03-08 16:17:09,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:17:09,485 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:17:09,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09 WrapperNode [2025-03-08 16:17:09,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:17:09,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:17:09,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:17:09,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:17:09,491 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:17:09" (1/1) ... [2025-03-08 16:17:09,499 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:17:09" (1/1) ... [2025-03-08 16:17:09,534 INFO L138 Inliner]: procedures = 36, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 400 [2025-03-08 16:17:09,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:17:09,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:17:09,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:17:09,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:17:09,545 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,579 INFO L175 MemorySlicer]: Split 111 memory accesses to 7 slices as follows [2, 18, 15, 35, 7, 23, 11]. 32 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 2, 2, 4, 1, 2, 1]. The 17 writes are split as follows [0, 2, 2, 6, 2, 2, 3]. [2025-03-08 16:17:09,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:17:09,629 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:17:09,629 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:17:09,629 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:17:09,630 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (1/1) ... [2025-03-08 16:17:09,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:17:09,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:17:09,661 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:17:09,666 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:17:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:17:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:17:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:17:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-08 16:17:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-08 16:17:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-08 16:17:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-08 16:17:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-08 16:17:09,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:17:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:17:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-08 16:17:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-08 16:17:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-08 16:17:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-08 16:17:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-08 16:17:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:17:09,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:17:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-08 16:17:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-08 16:17:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-08 16:17:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-08 16:17:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-08 16:17:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-08 16:17:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-08 16:17:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-08 16:17:09,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-08 16:17:09,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-08 16:17:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-08 16:17:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-08 16:17:09,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-08 16:17:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-08 16:17:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-08 16:17:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-08 16:17:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-08 16:17:09,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-08 16:17:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-08 16:17:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-08 16:17:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-08 16:17:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-08 16:17:09,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-08 16:17:09,691 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:17:09,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:17:09,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-08 16:17:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-08 16:17:09,843 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:17:09,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:17:10,480 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L101: havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite75#1;havoc property_#t~mem63#1;havoc property_#t~ite72#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite89#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-03-08 16:17:10,532 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-03-08 16:17:10,532 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:17:10,542 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:17:10,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:17:10,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:17:10 BoogieIcfgContainer [2025-03-08 16:17:10,543 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:17:10,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:17:10,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:17:10,548 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:17:10,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:17:09" (1/3) ... [2025-03-08 16:17:10,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c64156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:17:10, skipping insertion in model container [2025-03-08 16:17:10,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:17:09" (2/3) ... [2025-03-08 16:17:10,549 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c64156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:17:10, skipping insertion in model container [2025-03-08 16:17:10,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:17:10" (3/3) ... [2025-03-08 16:17:10,550 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-41.i [2025-03-08 16:17:10,560 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:17:10,561 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-41.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:17:10,602 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:17:10,610 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;@1770c0a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:17:10,611 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:17:10,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:17:10,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 16:17:10,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:10,623 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:10,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:10,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:10,626 INFO L85 PathProgramCache]: Analyzing trace with hash 134934688, now seen corresponding path program 1 times [2025-03-08 16:17:10,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:10,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168071799] [2025-03-08 16:17:10,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:10,639 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:17:10,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:10,641 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:17:10,642 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:17:10,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 16:17:10,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 16:17:10,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:10,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:10,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:17:10,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-08 16:17:10,952 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:10,952 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:10,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168071799] [2025-03-08 16:17:10,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168071799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:10,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:10,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:17:10,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997162182] [2025-03-08 16:17:10,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:10,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:17:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:10,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:17:10,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:17:10,976 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:17:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:10,994 INFO L93 Difference]: Finished difference Result 166 states and 257 transitions. [2025-03-08 16:17:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:17:10,995 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-08 16:17:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:10,999 INFO L225 Difference]: With dead ends: 166 [2025-03-08 16:17:10,999 INFO L226 Difference]: Without dead ends: 81 [2025-03-08 16:17:11,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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:17:11,003 INFO L435 NwaCegarLoop]: 115 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, 115 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:17:11,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:11,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-08 16:17:11,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-08 16:17:11,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:17:11,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-03-08 16:17:11,038 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2025-03-08 16:17:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:11,038 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-03-08 16:17:11,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:17:11,038 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-03-08 16:17:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 16:17:11,040 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:11,041 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:11,048 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:17:11,241 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:17:11,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:11,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2093516058, now seen corresponding path program 1 times [2025-03-08 16:17:11,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:11,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380133908] [2025-03-08 16:17:11,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:11,243 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:17:11,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:11,244 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:17:11,246 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:17:11,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 16:17:11,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 16:17:11,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:11,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:11,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 16:17:11,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:11,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:11,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-03-08 16:17:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-08 16:17:11,694 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:11,694 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:11,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380133908] [2025-03-08 16:17:11,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380133908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:11,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:11,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:17:11,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815257541] [2025-03-08 16:17:11,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:11,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:17:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:11,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:17:11,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:17:11,697 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:17:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:12,282 INFO L93 Difference]: Finished difference Result 160 states and 228 transitions. [2025-03-08 16:17:12,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:17:12,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-03-08 16:17:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:12,284 INFO L225 Difference]: With dead ends: 160 [2025-03-08 16:17:12,284 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 16:17:12,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:17:12,285 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 94 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:12,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 384 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:17:12,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 16:17:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-03-08 16:17:12,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:17:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2025-03-08 16:17:12,292 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 114 [2025-03-08 16:17:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:12,296 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2025-03-08 16:17:12,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:17:12,297 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2025-03-08 16:17:12,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 16:17:12,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:12,299 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:12,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:17:12,500 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:17:12,500 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:12,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:12,502 INFO L85 PathProgramCache]: Analyzing trace with hash -900310568, now seen corresponding path program 1 times [2025-03-08 16:17:12,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:12,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305651004] [2025-03-08 16:17:12,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:12,502 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:17:12,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:12,505 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:17:12,506 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:17:12,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 16:17:12,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 16:17:12,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:12,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:12,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 16:17:12,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:12,844 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:17:13,109 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 31 [2025-03-08 16:17:13,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:13,175 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 88 treesize of output 40 [2025-03-08 16:17:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 158 proven. 12 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2025-03-08 16:17:13,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:17:13,376 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:13,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305651004] [2025-03-08 16:17:13,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305651004] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:13,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:17:13,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2025-03-08 16:17:13,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000224503] [2025-03-08 16:17:13,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:13,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:17:13,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:13,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:17:13,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-08 16:17:13,377 INFO L87 Difference]: Start difference. First operand 81 states and 114 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:17:13,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:13,545 INFO L93 Difference]: Finished difference Result 216 states and 303 transitions. [2025-03-08 16:17:13,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:17:13,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-03-08 16:17:13,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:13,547 INFO L225 Difference]: With dead ends: 216 [2025-03-08 16:17:13,547 INFO L226 Difference]: Without dead ends: 138 [2025-03-08 16:17:13,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2025-03-08 16:17:13,548 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 73 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:13,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 586 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:17:13,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-08 16:17:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2025-03-08 16:17:13,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 108 states have (on average 1.3055555555555556) internal successors, (141), 109 states have internal predecessors, (141), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:17:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 189 transitions. [2025-03-08 16:17:13,565 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 189 transitions. Word has length 116 [2025-03-08 16:17:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:13,565 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 189 transitions. [2025-03-08 16:17:13,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:17:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 189 transitions. [2025-03-08 16:17:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 16:17:13,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:13,567 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:13,576 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:17:13,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:17:13,767 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:13,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:13,768 INFO L85 PathProgramCache]: Analyzing trace with hash 542169549, now seen corresponding path program 1 times [2025-03-08 16:17:13,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:13,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862813910] [2025-03-08 16:17:13,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:13,768 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:17:13,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:13,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:17:13,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:17:13,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 16:17:13,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 16:17:13,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:13,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:13,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 16:17:13,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:14,005 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:17:14,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:14,005 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862813910] [2025-03-08 16:17:14,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862813910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:14,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 16:17:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473655361] [2025-03-08 16:17:14,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:14,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 16:17:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:14,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 16:17:14,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 16:17:14,007 INFO L87 Difference]: Start difference. First operand 135 states and 189 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:17:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:14,026 INFO L93 Difference]: Finished difference Result 240 states and 335 transitions. [2025-03-08 16:17:14,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 16:17:14,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-03-08 16:17:14,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:14,029 INFO L225 Difference]: With dead ends: 240 [2025-03-08 16:17:14,030 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 16:17:14,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 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:17:14,032 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:14,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:17:14,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 16:17:14,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-08 16:17:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 82 states have internal predecessors, (100), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 16:17:14,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2025-03-08 16:17:14,051 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 117 [2025-03-08 16:17:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:14,051 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2025-03-08 16:17:14,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:17:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2025-03-08 16:17:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:17:14,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:14,053 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:14,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:17:14,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:17:14,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:14,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:14,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1667625270, now seen corresponding path program 1 times [2025-03-08 16:17:14,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:14,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058004715] [2025-03-08 16:17:14,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:14,254 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:17:14,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:14,256 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:17:14,258 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:17:14,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:17:14,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:17:14,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:14,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:14,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 16:17:14,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:14,500 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 21 treesize of output 17 [2025-03-08 16:17:14,554 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 66 treesize of output 54 [2025-03-08 16:17:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:17:14,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:17:14,580 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:14,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058004715] [2025-03-08 16:17:14,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058004715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:17:14,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:17:14,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:17:14,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396151448] [2025-03-08 16:17:14,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:14,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:17:14,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:14,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:17:14,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:17:14,582 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:17:14,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:17:14,892 INFO L93 Difference]: Finished difference Result 269 states and 366 transitions. [2025-03-08 16:17:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:17:14,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-08 16:17:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:17:14,894 INFO L225 Difference]: With dead ends: 269 [2025-03-08 16:17:14,894 INFO L226 Difference]: Without dead ends: 190 [2025-03-08 16:17:14,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:17:14,895 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 96 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:17:14,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 702 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:17:14,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-08 16:17:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 179. [2025-03-08 16:17:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 136 states have (on average 1.2279411764705883) internal successors, (167), 138 states have internal predecessors, (167), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 16:17:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 243 transitions. [2025-03-08 16:17:14,914 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 243 transitions. Word has length 118 [2025-03-08 16:17:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:17:14,915 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 243 transitions. [2025-03-08 16:17:14,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:17:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 243 transitions. [2025-03-08 16:17:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:17:14,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:17:14,920 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:17:14,928 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 (6)] Forceful destruction successful, exit code 0 [2025-03-08 16:17:15,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:17:15,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:17:15,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:17:15,121 INFO L85 PathProgramCache]: Analyzing trace with hash -819887563, now seen corresponding path program 1 times [2025-03-08 16:17:15,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:17:15,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349579702] [2025-03-08 16:17:15,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:17:15,122 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:17:15,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:17:15,124 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:17:15,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-08 16:17:15,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:17:30,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:17:30,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:17:30,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:17:31,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 16:17:31,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:17:31,124 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:17:32,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 101 [2025-03-08 16:17:44,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:17:44,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 394 treesize of output 144 [2025-03-08 16:17:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 27 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-08 16:17:46,406 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 16:17:56,168 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:17:56,168 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:17:56,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349579702] [2025-03-08 16:17:56,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349579702] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 16:17:56,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:17:56,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 18 [2025-03-08 16:17:56,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593209995] [2025-03-08 16:17:56,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:17:56,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:17:56,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:17:56,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:17:56,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2025-03-08 16:17:56,170 INFO L87 Difference]: Start difference. First operand 179 states and 243 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:18:01,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:18:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:18:07,188 INFO L93 Difference]: Finished difference Result 422 states and 568 transitions. [2025-03-08 16:18:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:18:07,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-03-08 16:18:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:18:07,197 INFO L225 Difference]: With dead ends: 422 [2025-03-08 16:18:07,197 INFO L226 Difference]: Without dead ends: 272 [2025-03-08 16:18:07,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2025-03-08 16:18:07,198 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 51 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2025-03-08 16:18:07,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 565 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 1 Unknown, 0 Unchecked, 9.4s Time] [2025-03-08 16:18:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-08 16:18:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 268. [2025-03-08 16:18:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 215 states have (on average 1.2511627906976743) internal successors, (269), 219 states have internal predecessors, (269), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 16:18:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 361 transitions. [2025-03-08 16:18:07,227 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 361 transitions. Word has length 118 [2025-03-08 16:18:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:18:07,227 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 361 transitions. [2025-03-08 16:18:07,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:18:07,227 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 361 transitions. [2025-03-08 16:18:07,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-08 16:18:07,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:18:07,228 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:18:07,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-08 16:18:07,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:18:07,429 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:18:07,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:18:07,429 INFO L85 PathProgramCache]: Analyzing trace with hash -608536650, now seen corresponding path program 1 times [2025-03-08 16:18:07,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:18:07,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978250467] [2025-03-08 16:18:07,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:18:07,430 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:18:07,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:18:07,432 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:18:07,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-08 16:18:07,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-08 16:18:08,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-08 16:18:08,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:18:08,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:18:08,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 16:18:08,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:18:08,229 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:18:10,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2025-03-08 16:18:10,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:18:10,533 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 321 treesize of output 141 [2025-03-08 16:18:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 151 proven. 54 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2025-03-08 16:18:13,389 INFO L312 TraceCheckSpWp]: Computing backward predicates...