./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.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 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:14:31,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:14:31,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:14:31,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:14:31,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:14:31,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:14:31,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:14:31,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:14:31,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:14:31,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:14:31,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:14:31,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:14:31,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:14:31,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:14:31,856 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:14:31,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:14:31,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:14:31,858 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:14:31,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:14:31,858 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:14:31,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:14:31,859 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 -> 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a [2025-03-17 06:14:32,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:14:32,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:14:32,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:14:32,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:14:32,085 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:14:32,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2025-03-17 06:14:33,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc392f336/80743d86dfe54384ab50236f310f85d1/FLAG3265292bb [2025-03-17 06:14:33,393 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:14:33,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2025-03-17 06:14:33,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc392f336/80743d86dfe54384ab50236f310f85d1/FLAG3265292bb [2025-03-17 06:14:33,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc392f336/80743d86dfe54384ab50236f310f85d1 [2025-03-17 06:14:33,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:14:33,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:14:33,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:14:33,711 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:14:33,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:14:33,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:33,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33, skipping insertion in model container [2025-03-17 06:14:33,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:33,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:14:33,832 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-sp_file-9.i[916,929] [2025-03-17 06:14:33,880 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:14:33,894 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:14:33,904 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-sp_file-9.i[916,929] [2025-03-17 06:14:33,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:14:33,951 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:14:33,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33 WrapperNode [2025-03-17 06:14:33,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:14:33,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:14:33,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:14:33,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:14:33,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:33,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:33,993 INFO L138 Inliner]: procedures = 29, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 348 [2025-03-17 06:14:33,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:14:33,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:14:33,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:14:33,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:14:34,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:34,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:34,005 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:34,022 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2025-03-17 06:14:34,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:34,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:34,028 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:34,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:34,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:34,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:34,033 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:14:34,035 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:14:34,035 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:14:34,036 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:14:34,036 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (1/1) ... [2025-03-17 06:14:34,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:14:34,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:14:34,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:14:34,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:14:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:14:34,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 06:14:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 06:14:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 06:14:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 06:14:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 06:14:34,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 06:14:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 06:14:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 06:14:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 06:14:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 06:14:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:14:34,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:14:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 06:14:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 06:14:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:14:34,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:14:34,164 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:14:34,166 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:14:34,425 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem45#1;havoc property_#t~ite63#1;havoc property_#t~mem47#1;havoc property_#t~mem46#1;havoc property_#t~mem48#1;havoc property_#t~mem49#1;havoc property_#t~ite52#1;havoc property_#t~mem50#1;havoc property_#t~mem51#1;havoc property_#t~mem53#1;havoc property_#t~ite62#1;havoc property_#t~mem54#1;havoc property_#t~ite59#1;havoc property_#t~mem56#1;havoc property_#t~mem55#1;havoc property_#t~mem58#1;havoc property_#t~mem57#1;havoc property_#t~mem61#1;havoc property_#t~mem60#1;havoc property_#t~mem64#1;havoc property_#t~bitwise65#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite71#1;havoc property_#t~mem70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~short72#1;havoc property_#t~mem73#1;havoc property_#t~short74#1;havoc property_#t~mem76#1;havoc property_#t~mem75#1;havoc property_#t~short77#1;havoc property_#t~ite83#1;havoc property_#t~mem81#1;havoc property_#t~mem78#1;havoc property_#t~ite80#1;havoc property_#t~mem79#1;havoc property_#t~mem82#1;havoc property_#t~short84#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1; [2025-03-17 06:14:34,447 INFO L? ?]: Removed 79 outVars from TransFormulas that were not future-live. [2025-03-17 06:14:34,447 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:14:34,458 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:14:34,460 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:14:34,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:14:34 BoogieIcfgContainer [2025-03-17 06:14:34,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:14:34,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:14:34,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:14:34,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:14:34,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:14:33" (1/3) ... [2025-03-17 06:14:34,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1467b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:14:34, skipping insertion in model container [2025-03-17 06:14:34,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:33" (2/3) ... [2025-03-17 06:14:34,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1467b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:14:34, skipping insertion in model container [2025-03-17 06:14:34,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:14:34" (3/3) ... [2025-03-17 06:14:34,468 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-9.i [2025-03-17 06:14:34,478 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:14:34,480 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-9.i that has 2 procedures, 70 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:14:34,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:14:34,525 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;@59650b3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:14:34,525 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:14:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 06:14:34,533 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:34,533 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:34,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:34,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:34,538 INFO L85 PathProgramCache]: Analyzing trace with hash 311913922, now seen corresponding path program 1 times [2025-03-17 06:14:34,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:34,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709554628] [2025-03-17 06:14:34,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:34,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 06:14:34,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 06:14:34,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:34,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:34,752 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 06:14:34,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:34,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709554628] [2025-03-17 06:14:34,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709554628] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:14:34,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391645904] [2025-03-17 06:14:34,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:34,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:14:34,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:14:34,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:14:34,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:14:34,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 06:14:34,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 06:14:34,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:34,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:34,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:14:34,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:34,936 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 06:14:34,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:14:34,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391645904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:34,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:14:34,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:14:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024945763] [2025-03-17 06:14:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:34,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:14:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:34,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:14:34,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:14:34,957 INFO L87 Difference]: Start difference. First operand has 70 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 06:14:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:34,978 INFO L93 Difference]: Finished difference Result 137 states and 203 transitions. [2025-03-17 06:14:34,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:14:34,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2025-03-17 06:14:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:34,985 INFO L225 Difference]: With dead ends: 137 [2025-03-17 06:14:34,985 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 06:14:34,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:14:34,992 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:34,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:14:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 06:14:35,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 06:14:35,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 61 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2025-03-17 06:14:35,018 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 58 [2025-03-17 06:14:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:35,018 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2025-03-17 06:14:35,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 06:14:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2025-03-17 06:14:35,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 06:14:35,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:35,021 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:35,028 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-17 06:14:35,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:14:35,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:35,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:35,223 INFO L85 PathProgramCache]: Analyzing trace with hash 460524671, now seen corresponding path program 1 times [2025-03-17 06:14:35,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:35,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247098204] [2025-03-17 06:14:35,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:35,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:35,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 06:14:35,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 06:14:35,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:35,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:35,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:35,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247098204] [2025-03-17 06:14:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247098204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:35,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:14:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84676191] [2025-03-17 06:14:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:35,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:14:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:35,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:14:35,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:14:35,417 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:35,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:35,451 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2025-03-17 06:14:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:14:35,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2025-03-17 06:14:35,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:35,455 INFO L225 Difference]: With dead ends: 138 [2025-03-17 06:14:35,455 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 06:14:35,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:14:35,457 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:35,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 262 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:14:35,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 06:14:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-03-17 06:14:35,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:35,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2025-03-17 06:14:35,465 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 58 [2025-03-17 06:14:35,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:35,467 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2025-03-17 06:14:35,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2025-03-17 06:14:35,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 06:14:35,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:35,469 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:35,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 06:14:35,469 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:35,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1336426688, now seen corresponding path program 1 times [2025-03-17 06:14:35,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:35,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997441163] [2025-03-17 06:14:35,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:35,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 06:14:35,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 06:14:35,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:35,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:35,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:35,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997441163] [2025-03-17 06:14:35,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997441163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:35,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:35,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:14:35,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046626591] [2025-03-17 06:14:35,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:35,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:14:35,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:35,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:14:35,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:14:35,618 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:35,651 INFO L93 Difference]: Finished difference Result 142 states and 199 transitions. [2025-03-17 06:14:35,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:14:35,652 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2025-03-17 06:14:35,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:35,653 INFO L225 Difference]: With dead ends: 142 [2025-03-17 06:14:35,653 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 06:14:35,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:14:35,654 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:35,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 263 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:14:35,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 06:14:35,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-03-17 06:14:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:35,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2025-03-17 06:14:35,661 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 58 [2025-03-17 06:14:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:35,662 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2025-03-17 06:14:35,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2025-03-17 06:14:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 06:14:35,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:35,663 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:35,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 06:14:35,663 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:35,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:35,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1151086145, now seen corresponding path program 1 times [2025-03-17 06:14:35,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:35,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893988722] [2025-03-17 06:14:35,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:35,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:35,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 06:14:35,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 06:14:35,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:35,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 06:14:36,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893988722] [2025-03-17 06:14:36,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893988722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:14:36,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914736891] [2025-03-17 06:14:36,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:36,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:14:36,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:14:36,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:14:36,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:14:36,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 06:14:36,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 06:14:36,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:36,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:36,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:14:36,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:36,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:14:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914736891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:14:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2025-03-17 06:14:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563938507] [2025-03-17 06:14:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:36,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:14:36,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:36,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:14:36,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:14:36,301 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:36,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:36,324 INFO L93 Difference]: Finished difference Result 146 states and 203 transitions. [2025-03-17 06:14:36,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:14:36,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2025-03-17 06:14:36,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:36,328 INFO L225 Difference]: With dead ends: 146 [2025-03-17 06:14:36,328 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 06:14:36,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:14:36,329 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:36,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 264 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:14:36,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 06:14:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-17 06:14:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2025-03-17 06:14:36,337 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 58 [2025-03-17 06:14:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:36,337 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2025-03-17 06:14:36,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2025-03-17 06:14:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 06:14:36,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:36,338 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:36,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:14:36,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-17 06:14:36,543 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:36,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:36,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1152009666, now seen corresponding path program 1 times [2025-03-17 06:14:36,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:36,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499218895] [2025-03-17 06:14:36,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:36,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:36,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 06:14:36,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 06:14:36,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:36,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:36,914 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 06:14:36,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:36,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499218895] [2025-03-17 06:14:36,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499218895] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:14:36,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206861050] [2025-03-17 06:14:36,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:36,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:14:36,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:14:36,918 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:14:36,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:14:37,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 06:14:37,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 06:14:37,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:37,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:37,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 06:14:37,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:37,102 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 19 treesize of output 7 [2025-03-17 06:14:37,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:14:37,455 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 18 treesize of output 14 [2025-03-17 06:14:37,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:14:37,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2025-03-17 06:14:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:37,474 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:14:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206861050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:37,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:14:37,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2025-03-17 06:14:37,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505994106] [2025-03-17 06:14:37,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:37,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:14:37,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:37,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:14:37,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:14:37,476 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:37,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:37,745 INFO L93 Difference]: Finished difference Result 227 states and 313 transitions. [2025-03-17 06:14:37,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:14:37,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2025-03-17 06:14:37,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:37,746 INFO L225 Difference]: With dead ends: 227 [2025-03-17 06:14:37,746 INFO L226 Difference]: Without dead ends: 154 [2025-03-17 06:14:37,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-17 06:14:37,747 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 104 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:37,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 308 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:14:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-17 06:14:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 97. [2025-03-17 06:14:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 06:14:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 133 transitions. [2025-03-17 06:14:37,763 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 133 transitions. Word has length 58 [2025-03-17 06:14:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:37,763 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 133 transitions. [2025-03-17 06:14:37,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 133 transitions. [2025-03-17 06:14:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-17 06:14:37,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:37,764 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:37,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:14:37,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:14:37,968 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:37,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:37,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1978173803, now seen corresponding path program 1 times [2025-03-17 06:14:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:37,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773901329] [2025-03-17 06:14:37,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:37,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-17 06:14:38,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-17 06:14:38,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:38,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:38,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:38,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773901329] [2025-03-17 06:14:38,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773901329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:38,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:38,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:14:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810179112] [2025-03-17 06:14:38,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:38,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:14:38,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:38,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:14:38,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:14:38,277 INFO L87 Difference]: Start difference. First operand 97 states and 133 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:38,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:38,390 INFO L93 Difference]: Finished difference Result 172 states and 237 transitions. [2025-03-17 06:14:38,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:14:38,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 59 [2025-03-17 06:14:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:38,392 INFO L225 Difference]: With dead ends: 172 [2025-03-17 06:14:38,392 INFO L226 Difference]: Without dead ends: 99 [2025-03-17 06:14:38,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:14:38,393 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 123 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:38,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 228 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:14:38,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-17 06:14:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-03-17 06:14:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 06:14:38,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 135 transitions. [2025-03-17 06:14:38,403 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 135 transitions. Word has length 59 [2025-03-17 06:14:38,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:38,404 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 135 transitions. [2025-03-17 06:14:38,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 135 transitions. [2025-03-17 06:14:38,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 06:14:38,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:38,405 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:38,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 06:14:38,405 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:38,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:38,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1457671121, now seen corresponding path program 1 times [2025-03-17 06:14:38,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085349321] [2025-03-17 06:14:38,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:38,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:38,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 06:14:38,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 06:14:38,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:38,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:38,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:38,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085349321] [2025-03-17 06:14:38,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085349321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:38,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:38,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 06:14:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190377772] [2025-03-17 06:14:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:38,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 06:14:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:38,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 06:14:38,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 06:14:38,589 INFO L87 Difference]: Start difference. First operand 99 states and 135 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:38,709 INFO L93 Difference]: Finished difference Result 206 states and 279 transitions. [2025-03-17 06:14:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:14:38,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2025-03-17 06:14:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:38,711 INFO L225 Difference]: With dead ends: 206 [2025-03-17 06:14:38,711 INFO L226 Difference]: Without dead ends: 131 [2025-03-17 06:14:38,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:14:38,711 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 144 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:38,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 236 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 06:14:38,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-17 06:14:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2025-03-17 06:14:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 06:14:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 137 transitions. [2025-03-17 06:14:38,718 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 137 transitions. Word has length 63 [2025-03-17 06:14:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:38,718 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 137 transitions. [2025-03-17 06:14:38,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:38,718 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2025-03-17 06:14:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-17 06:14:38,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:38,719 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:38,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:14:38,719 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:38,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1996673030, now seen corresponding path program 1 times [2025-03-17 06:14:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905107225] [2025-03-17 06:14:38,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:38,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:38,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-17 06:14:38,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-17 06:14:38,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:38,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:39,335 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:39,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:39,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905107225] [2025-03-17 06:14:39,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905107225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:39,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:39,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:14:39,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443696481] [2025-03-17 06:14:39,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:39,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:14:39,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:39,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:14:39,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:14:39,337 INFO L87 Difference]: Start difference. First operand 101 states and 137 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 06:14:39,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:39,609 INFO L93 Difference]: Finished difference Result 230 states and 312 transitions. [2025-03-17 06:14:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:14:39,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 63 [2025-03-17 06:14:39,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:39,610 INFO L225 Difference]: With dead ends: 230 [2025-03-17 06:14:39,610 INFO L226 Difference]: Without dead ends: 153 [2025-03-17 06:14:39,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:14:39,612 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 167 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:39,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 254 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:14:39,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-17 06:14:39,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 124. [2025-03-17 06:14:39,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 111 states have internal predecessors, (150), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 06:14:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 170 transitions. [2025-03-17 06:14:39,629 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 170 transitions. Word has length 63 [2025-03-17 06:14:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:39,630 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 170 transitions. [2025-03-17 06:14:39,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 06:14:39,630 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 170 transitions. [2025-03-17 06:14:39,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 06:14:39,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:39,631 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:39,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:14:39,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:39,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:39,632 INFO L85 PathProgramCache]: Analyzing trace with hash 13813659, now seen corresponding path program 1 times [2025-03-17 06:14:39,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:39,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698438605] [2025-03-17 06:14:39,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:39,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 06:14:39,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 06:14:39,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:39,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:40,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:14:40,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698438605] [2025-03-17 06:14:40,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698438605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:40,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:40,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:14:40,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858507983] [2025-03-17 06:14:40,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:40,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:14:40,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:14:40,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:14:40,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:14:40,077 INFO L87 Difference]: Start difference. First operand 124 states and 170 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:40,373 INFO L93 Difference]: Finished difference Result 282 states and 385 transitions. [2025-03-17 06:14:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:14:40,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2025-03-17 06:14:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:40,375 INFO L225 Difference]: With dead ends: 282 [2025-03-17 06:14:40,375 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 06:14:40,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:14:40,375 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 94 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:40,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 404 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:14:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 06:14:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 126. [2025-03-17 06:14:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 113 states have (on average 1.3539823008849559) internal successors, (153), 113 states have internal predecessors, (153), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 06:14:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 173 transitions. [2025-03-17 06:14:40,385 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 173 transitions. Word has length 64 [2025-03-17 06:14:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:40,386 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 173 transitions. [2025-03-17 06:14:40,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 173 transitions. [2025-03-17 06:14:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 06:14:40,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:40,386 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:40,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:14:40,387 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:40,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1167807456, now seen corresponding path program 1 times [2025-03-17 06:14:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:14:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637168779] [2025-03-17 06:14:40,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:14:40,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 06:14:40,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 06:14:40,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:40,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:14:40,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1276173911] [2025-03-17 06:14:40,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:40,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:14:40,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:14:40,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:14:40,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:14:40,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 06:14:40,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 06:14:40,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:40,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:14:40,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:14:40,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 06:14:40,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 06:14:40,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:40,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:14:40,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:14:40,715 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:14:40,716 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:14:40,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:14:40,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:14:40,920 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:40,986 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:14:40,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:14:40 BoogieIcfgContainer [2025-03-17 06:14:40,988 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:14:40,988 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:14:40,988 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:14:40,988 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:14:40,989 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:14:34" (3/4) ... [2025-03-17 06:14:40,990 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:14:40,991 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:14:40,992 INFO L158 Benchmark]: Toolchain (without parser) took 7281.76ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 114.1MB in the beginning and 101.7MB in the end (delta: 12.4MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2025-03-17 06:14:40,992 INFO L158 Benchmark]: CDTParser took 0.94ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:14:40,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.14ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 99.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:14:40,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.57ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 97.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:14:40,993 INFO L158 Benchmark]: Boogie Preprocessor took 38.63ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 94.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:14:40,994 INFO L158 Benchmark]: IcfgBuilder took 425.53ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 67.7MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 06:14:40,994 INFO L158 Benchmark]: TraceAbstraction took 6524.87ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 67.2MB in the beginning and 101.7MB in the end (delta: -34.5MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. [2025-03-17 06:14:40,994 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 268.4MB. Free memory was 101.7MB in the beginning and 101.7MB in the end (delta: 54.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:14:40,995 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.94ms. Allocated memory is still 201.3MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.14ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 99.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.57ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 97.4MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.63ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 94.4MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 425.53ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 67.7MB in the end (delta: 26.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6524.87ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 67.2MB in the beginning and 101.7MB in the end (delta: -34.5MB). Peak memory consumption was 90.9MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 268.4MB. Free memory was 101.7MB in the beginning and 101.7MB in the end (delta: 54.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 68, overapproximation of shiftLeft at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 95. Possible FailurePath: [L33] unsigned char isInitial = 0; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L34-L44] struct WrapperStruct0 WrapperStruct0 = { 10, 4, 0, 100, 32, 9.2, 0.975, 1, -16 }; [L45] unsigned char* WrapperStruct0_var_1_1_Pointer = &(WrapperStruct0.var_1_1); [L46] unsigned char* WrapperStruct0_var_1_3_Pointer = &(WrapperStruct0.var_1_3); [L47] unsigned char* WrapperStruct0_var_1_7_Pointer = &(WrapperStruct0.var_1_7); [L48] signed short int* WrapperStruct0_var_1_8_Pointer = &(WrapperStruct0.var_1_8); [L49] unsigned char* WrapperStruct0_var_1_9_Pointer = &(WrapperStruct0.var_1_9); [L50] double* WrapperStruct0_var_1_10_Pointer = &(WrapperStruct0.var_1_10); [L51] double* WrapperStruct0_var_1_11_Pointer = &(WrapperStruct0.var_1_11); [L52] signed short int* WrapperStruct0_var_1_12_Pointer = &(WrapperStruct0.var_1_12); [L53] signed long int* WrapperStruct0_var_1_14_Pointer = &(WrapperStruct0.var_1_14); [L54] unsigned char last_1_WrapperStruct0_var_1_1 = 10; [L55] double last_1_WrapperStruct0_var_1_10 = 9.2; [L56] signed short int last_1_WrapperStruct0_var_1_12 = 1; [L57] signed long int last_1_WrapperStruct0_var_1_14 = -16; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] CALL updateLastVariables() [L98] EXPR WrapperStruct0.var_1_1 [L98] last_1_WrapperStruct0_var_1_1 = WrapperStruct0.var_1_1 [L99] EXPR WrapperStruct0.var_1_10 [L99] last_1_WrapperStruct0_var_1_10 = WrapperStruct0.var_1_10 [L100] EXPR WrapperStruct0.var_1_12 [L100] last_1_WrapperStruct0_var_1_12 = WrapperStruct0.var_1_12 [L101] EXPR WrapperStruct0.var_1_14 [L101] last_1_WrapperStruct0_var_1_14 = WrapperStruct0.var_1_14 [L111] RET updateLastVariables() [L112] CALL updateVariables() [L88] WrapperStruct0.var_1_3 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L89] CALL assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L89] RET assume_abort_if_not(WrapperStruct0.var_1_3 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] EXPR WrapperStruct0.var_1_3 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] CALL assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L90] RET assume_abort_if_not(WrapperStruct0.var_1_3 <= 254) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L91] WrapperStruct0.var_1_7 = __VERIFIER_nondet_uchar() [L92] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L92] CALL assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L92] RET assume_abort_if_not(WrapperStruct0.var_1_7 >= 0) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] EXPR WrapperStruct0.var_1_7 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] CALL assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L93] RET assume_abort_if_not(WrapperStruct0.var_1_7 <= 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L94] WrapperStruct0.var_1_11 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F [L95] EXPR WrapperStruct0.var_1_11 [L95] EXPR WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] EXPR (WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] CALL assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L20] COND FALSE !(!cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L95] RET assume_abort_if_not((WrapperStruct0.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct0.var_1_11 <= -1.0e-20F) || (WrapperStruct0.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct0.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L112] RET updateVariables() [L113] CALL step() [L61] unsigned char stepLocal_0 = last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10; VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10, stepLocal_0=0] [L62] COND FALSE !(((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || stepLocal_0) [L65] (*(WrapperStruct0_var_1_12_Pointer)) = last_1_WrapperStruct0_var_1_12 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L67] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L67] (*(WrapperStruct0_var_1_14_Pointer)) = (*(WrapperStruct0_var_1_12_Pointer)) [L68] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] EXPR 10 << (*(WrapperStruct0_var_1_12_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L68] EXPR \read(*WrapperStruct0_var_1_14_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L68] COND TRUE (10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer))) [L69] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L69] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L69] (*(WrapperStruct0_var_1_8_Pointer)) = ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))) [L71] (*(WrapperStruct0_var_1_9_Pointer)) = 64 [L72] EXPR \read(*WrapperStruct0_var_1_11_Pointer) [L72] (*(WrapperStruct0_var_1_10_Pointer)) = (*(WrapperStruct0_var_1_11_Pointer)) [L73] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L73] COND TRUE (*(WrapperStruct0_var_1_12_Pointer)) <= 16 [L74] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L74] (*(WrapperStruct0_var_1_1_Pointer)) = (*(WrapperStruct0_var_1_3_Pointer)) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) [L104] EXPR \read(*WrapperStruct0_var_1_1_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L104] EXPR ((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR 10 << (*(WrapperStruct0_var_1_12_Pointer)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR \read(*WrapperStruct0_var_1_3_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_14_Pointer) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1 [L104] EXPR \read(*WrapperStruct0_var_1_8_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_12_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_14_Pointer) [L104] EXPR ((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1 VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) [L104] EXPR \read(*WrapperStruct0_var_1_9_Pointer) [L104] EXPR ((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64)) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) [L104] EXPR \read(*WrapperStruct0_var_1_10_Pointer) [L104] EXPR \read(*WrapperStruct0_var_1_11_Pointer) [L104] EXPR (((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR ((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104] EXPR (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L104-L105] return (((((((*(WrapperStruct0_var_1_12_Pointer)) <= 16) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : (((((((*(WrapperStruct0_var_1_10_Pointer))) > ((*(WrapperStruct0_var_1_10_Pointer)))) ? ((*(WrapperStruct0_var_1_10_Pointer))) : ((*(WrapperStruct0_var_1_10_Pointer))))) < (*(WrapperStruct0_var_1_10_Pointer))) ? ((*(WrapperStruct0_var_1_7_Pointer)) ? ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer))))) : ((*(WrapperStruct0_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct0_var_1_3_Pointer)))))) && (((10 << (*(WrapperStruct0_var_1_12_Pointer))) < ((*(WrapperStruct0_var_1_3_Pointer)) * (*(WrapperStruct0_var_1_14_Pointer)))) ? ((*(WrapperStruct0_var_1_8_Pointer)) == ((signed short int) ((*(WrapperStruct0_var_1_12_Pointer)) + (*(WrapperStruct0_var_1_14_Pointer))))) : 1)) && ((*(WrapperStruct0_var_1_9_Pointer)) == ((unsigned char) 64))) && ((*(WrapperStruct0_var_1_10_Pointer)) == ((double) (*(WrapperStruct0_var_1_11_Pointer))))) && ((((last_1_WrapperStruct0_var_1_12 + last_1_WrapperStruct0_var_1_1) < 10) || (last_1_WrapperStruct0_var_1_10 > last_1_WrapperStruct0_var_1_10)) ? ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) (((((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) > (last_1_WrapperStruct0_var_1_1)) ? ((((*(WrapperStruct0_var_1_3_Pointer)) + last_1_WrapperStruct0_var_1_12) - ((((last_1_WrapperStruct0_var_1_14) > (last_1_WrapperStruct0_var_1_12)) ? (last_1_WrapperStruct0_var_1_14) : (last_1_WrapperStruct0_var_1_12))))) : (last_1_WrapperStruct0_var_1_1))))) : ((*(WrapperStruct0_var_1_12_Pointer)) == ((signed short int) last_1_WrapperStruct0_var_1_12)))) && ((*(WrapperStruct0_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct0_var_1_12_Pointer)))) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] [L19] reach_error() VAL [WrapperStruct0={4:0}, WrapperStruct0_var_1_10_Pointer={4:6}, WrapperStruct0_var_1_11_Pointer={4:14}, WrapperStruct0_var_1_12_Pointer={4:22}, WrapperStruct0_var_1_14_Pointer={4:24}, WrapperStruct0_var_1_1_Pointer={4:0}, WrapperStruct0_var_1_3_Pointer={4:1}, WrapperStruct0_var_1_7_Pointer={4:2}, WrapperStruct0_var_1_8_Pointer={4:3}, WrapperStruct0_var_1_9_Pointer={4:5}, isInitial=1, last_1_WrapperStruct0_var_1_10=46/5, last_1_WrapperStruct0_var_1_12=1, last_1_WrapperStruct0_var_1_14=-16, last_1_WrapperStruct0_var_1_1=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 105 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 635 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 635 mSDsluCounter, 2313 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1599 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1069 IncrementalHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 714 mSDtfsCounter, 1069 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=9, InterpolantAutomatonStates: 47, 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, 9 MinimizatonAttempts, 175 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 841 NumberOfCodeBlocks, 841 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 701 ConstructedInterpolants, 0 QuantifiedInterpolants, 3206 SizeOfPredicates, 8 NumberOfNonLiveVariables, 866 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 448/480 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:14:41,010 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-sp_file-9.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 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:14:42,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:14:42,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:14:42,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:14:42,824 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:14:42,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:14:42,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:14:42,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:14:42,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:14:42,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:14:42,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:14:42,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:14:42,848 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:14:42,848 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:14:42,848 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:14:42,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:14:42,849 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:14:42,849 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:14:42,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:14:42,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:14:42,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:14:42,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:14:42,852 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:14:42,852 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:14:42,852 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:14:42,852 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:14:42,852 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:14:42,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:14:42,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:14:42,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:14:42,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:14:42,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:14:42,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:14:42,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:14:42,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:14:42,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:14:42,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:14:42,853 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:14:42,853 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:14:42,853 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:14:42,854 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:14:42,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:14:42,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:14:42,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:14:42,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:14:42,854 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 -> 671a45704fa186ff8f8ae16fa1f231720ab75623ea1dd3c585bf6353937ced8a [2025-03-17 06:14:43,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:14:43,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:14:43,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:14:43,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:14:43,088 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:14:43,088 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2025-03-17 06:14:44,237 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a936cfd/f2cdf2982f7e4d3f9da8b49e4588fed5/FLAGa4ac153bd [2025-03-17 06:14:44,422 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:14:44,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-9.i [2025-03-17 06:14:44,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a936cfd/f2cdf2982f7e4d3f9da8b49e4588fed5/FLAGa4ac153bd [2025-03-17 06:14:44,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3a936cfd/f2cdf2982f7e4d3f9da8b49e4588fed5 [2025-03-17 06:14:44,793 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:14:44,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:14:44,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:14:44,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:14:44,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:14:44,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f68b18b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44, skipping insertion in model container [2025-03-17 06:14:44,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:44,811 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:14:44,901 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-sp_file-9.i[916,929] [2025-03-17 06:14:44,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:14:44,950 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:14:44,956 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-sp_file-9.i[916,929] [2025-03-17 06:14:44,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:14:44,991 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:14:44,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44 WrapperNode [2025-03-17 06:14:44,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:14:44,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:14:44,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:14:44,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:14:44,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,037 INFO L138 Inliner]: procedures = 36, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 334 [2025-03-17 06:14:45,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:14:45,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:14:45,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:14:45,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:14:45,047 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,075 INFO L175 MemorySlicer]: Split 86 memory accesses to 2 slices as follows [2, 84]. 98 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 9]. The 13 writes are split as follows [0, 13]. [2025-03-17 06:14:45,079 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,080 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,096 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,098 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,098 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:14:45,101 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:14:45,101 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:14:45,101 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:14:45,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (1/1) ... [2025-03-17 06:14:45,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:14:45,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:14:45,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:14:45,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:14:45,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:14:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:14:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:14:45,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:14:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:14:45,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:14:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:14:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:14:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:14:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:14:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:14:45,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:14:45,226 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:14:45,227 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:14:45,594 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L104: havoc property_#t~mem44#1;havoc property_#t~ite62#1;havoc property_#t~mem46#1;havoc property_#t~mem45#1;havoc property_#t~mem47#1;havoc property_#t~mem48#1;havoc property_#t~ite51#1;havoc property_#t~mem49#1;havoc property_#t~mem50#1;havoc property_#t~mem52#1;havoc property_#t~ite61#1;havoc property_#t~mem53#1;havoc property_#t~ite58#1;havoc property_#t~mem55#1;havoc property_#t~mem54#1;havoc property_#t~mem57#1;havoc property_#t~mem56#1;havoc property_#t~mem60#1;havoc property_#t~mem59#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~ite69#1;havoc property_#t~mem68#1;havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~short70#1;havoc property_#t~mem71#1;havoc property_#t~short72#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~short75#1;havoc property_#t~ite81#1;havoc property_#t~mem79#1;havoc property_#t~mem76#1;havoc property_#t~ite78#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~short82#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~short85#1; [2025-03-17 06:14:45,622 INFO L? ?]: Removed 77 outVars from TransFormulas that were not future-live. [2025-03-17 06:14:45,622 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:14:45,629 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:14:45,629 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:14:45,630 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:14:45 BoogieIcfgContainer [2025-03-17 06:14:45,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:14:45,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:14:45,632 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:14:45,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:14:45,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:14:44" (1/3) ... [2025-03-17 06:14:45,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787a9dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:14:45, skipping insertion in model container [2025-03-17 06:14:45,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:14:44" (2/3) ... [2025-03-17 06:14:45,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787a9dde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:14:45, skipping insertion in model container [2025-03-17 06:14:45,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:14:45" (3/3) ... [2025-03-17 06:14:45,637 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-9.i [2025-03-17 06:14:45,648 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:14:45,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-9.i that has 2 procedures, 64 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:14:45,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:14:45,711 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;@450dbc8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:14:45,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:14:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 06:14:45,720 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:45,720 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:45,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:45,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash -11116572, now seen corresponding path program 1 times [2025-03-17 06:14:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:14:45,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887151585] [2025-03-17 06:14:45,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:45,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:45,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:14:45,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:14:45,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:14:45,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 06:14:45,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 06:14:45,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:45,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:45,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:14:45,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:45,951 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-17 06:14:45,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:14:45,952 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:14:45,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887151585] [2025-03-17 06:14:45,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887151585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:45,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:45,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:14:45,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235044287] [2025-03-17 06:14:45,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:45,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:14:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:14:45,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:14:45,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:14:45,977 INFO L87 Difference]: Start difference. First operand has 64 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 06:14:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:45,999 INFO L93 Difference]: Finished difference Result 125 states and 187 transitions. [2025-03-17 06:14:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:14:46,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2025-03-17 06:14:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:46,005 INFO L225 Difference]: With dead ends: 125 [2025-03-17 06:14:46,005 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 06:14:46,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:14:46,010 INFO L435 NwaCegarLoop]: 88 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, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:46,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:14:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 06:14:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 06:14:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:46,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2025-03-17 06:14:46,041 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 56 [2025-03-17 06:14:46,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:46,041 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2025-03-17 06:14:46,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 06:14:46,042 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2025-03-17 06:14:46,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 06:14:46,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:46,043 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:46,051 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-17 06:14:46,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:46,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:46,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:46,249 INFO L85 PathProgramCache]: Analyzing trace with hash -15431199, now seen corresponding path program 1 times [2025-03-17 06:14:46,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:14:46,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15279485] [2025-03-17 06:14:46,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:46,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:46,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:14:46,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:14:46,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:14:46,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 06:14:46,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 06:14:46,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:46,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:46,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:14:46,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:46,442 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:14:46,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:14:46,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15279485] [2025-03-17 06:14:46,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15279485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:46,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:46,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:14:46,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49691407] [2025-03-17 06:14:46,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:46,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:14:46,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:14:46,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:14:46,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:14:46,447 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:46,479 INFO L93 Difference]: Finished difference Result 126 states and 179 transitions. [2025-03-17 06:14:46,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:14:46,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-03-17 06:14:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:46,480 INFO L225 Difference]: With dead ends: 126 [2025-03-17 06:14:46,480 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 06:14:46,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:14:46,481 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:46,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 244 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:14:46,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 06:14:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2025-03-17 06:14:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2025-03-17 06:14:46,488 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 56 [2025-03-17 06:14:46,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:46,489 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2025-03-17 06:14:46,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2025-03-17 06:14:46,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 06:14:46,491 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:46,491 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:46,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-17 06:14:46,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:46,692 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:46,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1812382558, now seen corresponding path program 1 times [2025-03-17 06:14:46,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:14:46,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262259273] [2025-03-17 06:14:46,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:46,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:46,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:14:46,711 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:14:46,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:14:46,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 06:14:46,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 06:14:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:46,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 06:14:46,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:46,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:14:46,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:14:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262259273] [2025-03-17 06:14:46,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262259273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:46,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:46,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 06:14:46,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2714833] [2025-03-17 06:14:46,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:46,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:14:46,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:14:46,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:14:46,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:14:46,912 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:46,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:46,958 INFO L93 Difference]: Finished difference Result 130 states and 183 transitions. [2025-03-17 06:14:46,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:14:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-03-17 06:14:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:46,961 INFO L225 Difference]: With dead ends: 130 [2025-03-17 06:14:46,961 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 06:14:46,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 06:14:46,962 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:46,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 317 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:14:46,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 06:14:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2025-03-17 06:14:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2025-03-17 06:14:46,972 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 56 [2025-03-17 06:14:46,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:46,972 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-03-17 06:14:46,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:46,972 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2025-03-17 06:14:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 06:14:46,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:46,973 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:46,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-17 06:14:47,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:47,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:47,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 675130275, now seen corresponding path program 1 times [2025-03-17 06:14:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:14:47,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213295377] [2025-03-17 06:14:47,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:47,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:47,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:14:47,177 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:14:47,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-17 06:14:47,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 06:14:47,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 06:14:47,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:47,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:47,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 06:14:47,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:47,357 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:47,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:14:47,358 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:14:47,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213295377] [2025-03-17 06:14:47,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213295377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:14:47,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:14:47,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 06:14:47,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553277700] [2025-03-17 06:14:47,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:47,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 06:14:47,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:14:47,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 06:14:47,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:14:47,361 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:47,419 INFO L93 Difference]: Finished difference Result 136 states and 190 transitions. [2025-03-17 06:14:47,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:14:47,420 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-03-17 06:14:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:47,420 INFO L225 Difference]: With dead ends: 136 [2025-03-17 06:14:47,420 INFO L226 Difference]: Without dead ends: 71 [2025-03-17 06:14:47,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:14:47,421 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:47,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 455 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:14:47,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-17 06:14:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-03-17 06:14:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.3650793650793651) internal successors, (86), 63 states have internal predecessors, (86), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:47,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 96 transitions. [2025-03-17 06:14:47,429 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 96 transitions. Word has length 56 [2025-03-17 06:14:47,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:47,430 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 96 transitions. [2025-03-17 06:14:47,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 96 transitions. [2025-03-17 06:14:47,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-17 06:14:47,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:47,432 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:47,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 06:14:47,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:47,636 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:47,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:47,637 INFO L85 PathProgramCache]: Analyzing trace with hash 676053796, now seen corresponding path program 1 times [2025-03-17 06:14:47,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:14:47,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508418761] [2025-03-17 06:14:47,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:47,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:47,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:14:47,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:14:47,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-17 06:14:47,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-17 06:14:47,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-17 06:14:47,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:47,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:47,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 06:14:47,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:48,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:14:48,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:14:49,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 06:14:52,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2025-03-17 06:14:52,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2025-03-17 06:14:52,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 55 [2025-03-17 06:14:52,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 66 [2025-03-17 06:14:52,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 85 [2025-03-17 06:14:52,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:14:52,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 56 [2025-03-17 06:14:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 06:14:52,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:14:52,985 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 06:14:52,985 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:14:52,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508418761] [2025-03-17 06:14:52,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508418761] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 06:14:52,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:14:52,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2025-03-17 06:14:52,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403373102] [2025-03-17 06:14:52,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:14:52,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 06:14:52,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:14:52,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 06:14:52,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2025-03-17 06:14:52,986 INFO L87 Difference]: Start difference. First operand 70 states and 96 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:53,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:14:53,220 INFO L93 Difference]: Finished difference Result 142 states and 195 transitions. [2025-03-17 06:14:53,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 06:14:53,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 56 [2025-03-17 06:14:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:14:53,221 INFO L225 Difference]: With dead ends: 142 [2025-03-17 06:14:53,221 INFO L226 Difference]: Without dead ends: 73 [2025-03-17 06:14:53,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=33, Invalid=148, Unknown=1, NotChecked=0, Total=182 [2025-03-17 06:14:53,222 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 43 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 06:14:53,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 220 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 06:14:53,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-17 06:14:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2025-03-17 06:14:53,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 06:14:53,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 98 transitions. [2025-03-17 06:14:53,226 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 98 transitions. Word has length 56 [2025-03-17 06:14:53,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:14:53,226 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 98 transitions. [2025-03-17 06:14:53,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 06:14:53,226 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2025-03-17 06:14:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 06:14:53,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:14:53,227 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:14:53,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-17 06:14:53,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:53,427 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:14:53,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:14:53,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1509638592, now seen corresponding path program 1 times [2025-03-17 06:14:53,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:14:53,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910568064] [2025-03-17 06:14:53,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:14:53,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:14:53,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:14:53,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:14:53,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 (7)] Waiting until timeout for monitored process [2025-03-17 06:14:53,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 06:14:53,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 06:14:53,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:14:53,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:14:53,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 06:14:53,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:14:55,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-03-17 06:14:56,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 55 [2025-03-17 06:14:56,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 71 [2025-03-17 06:14:56,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 87 [2025-03-17 06:14:56,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 135 [2025-03-17 06:14:56,534 INFO L349 Elim1Store]: treesize reduction 79, result has 12.2 percent of original size [2025-03-17 06:14:56,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 205 treesize of output 164 [2025-03-17 06:14:57,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:14:57,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 354 treesize of output 154 [2025-03-17 06:14:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 06:14:57,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:15:30,023 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_138 (_ BitVec 32)) (~WrapperStruct0_var_1_3_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct0_var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse11 (let ((.cse13 ((_ sign_extend 16) ((_ extract 15 0) v_ArrVal_138)))) (let ((.cse12 (let ((.cse14 (store |c_#memory_int#1| c_~WrapperStruct0_var_1_12_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct0_var_1_12_Pointer~0.base) c_~WrapperStruct0_var_1_12_Pointer~0.offset v_ArrVal_138)))) (store .cse14 c_~WrapperStruct0_var_1_14_Pointer~0.base (store (select .cse14 c_~WrapperStruct0_var_1_14_Pointer~0.base) c_~WrapperStruct0_var_1_14_Pointer~0.offset .cse13))))) (store .cse12 c_~WrapperStruct0_var_1_8_Pointer~0.base (store (select .cse12 c_~WrapperStruct0_var_1_8_Pointer~0.base) c_~WrapperStruct0_var_1_8_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse12 c_~WrapperStruct0_var_1_12_Pointer~0.base) c_~WrapperStruct0_var_1_12_Pointer~0.offset))) .cse13))))))))) (store .cse11 c_~WrapperStruct0_var_1_9_Pointer~0.base (store (select .cse11 c_~WrapperStruct0_var_1_9_Pointer~0.base) c_~WrapperStruct0_var_1_9_Pointer~0.offset ((_ sign_extend 24) (_ bv64 8))))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~WrapperStruct0_var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct0_var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) c_~WrapperStruct0_var_1_10_Pointer~0.offset))) (let ((.cse7 (let ((.cse10 (store .cse3 c_~WrapperStruct0_var_1_10_Pointer~0.base (store (store (select .cse3 c_~WrapperStruct0_var_1_10_Pointer~0.base) c_~WrapperStruct0_var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))))) (store .cse10 c_~WrapperStruct0_var_1_1_Pointer~0.base (store (select .cse10 c_~WrapperStruct0_var_1_1_Pointer~0.base) c_~WrapperStruct0_var_1_1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse10 c_~WrapperStruct0_var_1_3_Pointer~0.base) ~WrapperStruct0_var_1_3_Pointer~0.offset)))))))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~WrapperStruct0_var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~WrapperStruct0_var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~WrapperStruct0_var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~WrapperStruct0_var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2025-03-17 06:15:30,479 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:15:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910568064] [2025-03-17 06:15:30,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910568064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:15:30,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [635706651] [2025-03-17 06:15:30,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:15:30,479 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 06:15:30,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 06:15:30,481 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 06:15:30,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-17 06:15:30,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 06:15:31,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 06:15:31,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:15:31,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:15:31,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-17 06:15:31,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:15:34,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 06:15:36,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 63 [2025-03-17 06:15:37,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 79 [2025-03-17 06:15:37,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 95 [2025-03-17 06:15:38,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 28 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 143 [2025-03-17 06:15:38,499 INFO L349 Elim1Store]: treesize reduction 79, result has 12.2 percent of original size [2025-03-17 06:15:38,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 9 case distinctions, treesize of input 88 treesize of output 111 [2025-03-17 06:15:39,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 101 [2025-03-17 06:15:39,849 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 06:15:39,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 06:16:00,528 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (v_ArrVal_165 (_ BitVec 32)) (~WrapperStruct0_var_1_3_Pointer~0.offset (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct0_var_1_11_Pointer~0.offset)) (.cse3 (let ((.cse11 (let ((.cse13 ((_ sign_extend 16) ((_ extract 15 0) v_ArrVal_165)))) (let ((.cse12 (let ((.cse14 (store |c_#memory_int#1| c_~WrapperStruct0_var_1_12_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct0_var_1_12_Pointer~0.base) c_~WrapperStruct0_var_1_12_Pointer~0.offset v_ArrVal_165)))) (store .cse14 c_~WrapperStruct0_var_1_14_Pointer~0.base (store (select .cse14 c_~WrapperStruct0_var_1_14_Pointer~0.base) c_~WrapperStruct0_var_1_14_Pointer~0.offset .cse13))))) (store .cse12 c_~WrapperStruct0_var_1_8_Pointer~0.base (store (select .cse12 c_~WrapperStruct0_var_1_8_Pointer~0.base) c_~WrapperStruct0_var_1_8_Pointer~0.offset ((_ sign_extend 16) ((_ extract 15 0) (bvadd .cse13 ((_ sign_extend 16) ((_ extract 15 0) (select (select .cse12 c_~WrapperStruct0_var_1_12_Pointer~0.base) c_~WrapperStruct0_var_1_12_Pointer~0.offset)))))))))))) (store .cse11 c_~WrapperStruct0_var_1_9_Pointer~0.base (store (select .cse11 c_~WrapperStruct0_var_1_9_Pointer~0.base) c_~WrapperStruct0_var_1_9_Pointer~0.offset ((_ sign_extend 24) (_ bv64 8))))))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (let ((.cse0 (let ((.cse1 (select .cse3 c_~WrapperStruct0_var_1_11_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct0_var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) (let ((.cse6 (bvadd (_ bv4 32) c_~WrapperStruct0_var_1_10_Pointer~0.offset))) (let ((.cse7 (let ((.cse10 (store .cse3 c_~WrapperStruct0_var_1_10_Pointer~0.base (store (store (select .cse3 c_~WrapperStruct0_var_1_10_Pointer~0.base) c_~WrapperStruct0_var_1_10_Pointer~0.offset ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_27|)) .cse6 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|))))) (store .cse10 c_~WrapperStruct0_var_1_1_Pointer~0.base (store (select .cse10 c_~WrapperStruct0_var_1_1_Pointer~0.base) c_~WrapperStruct0_var_1_1_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse10 c_~WrapperStruct0_var_1_3_Pointer~0.base) ~WrapperStruct0_var_1_3_Pointer~0.offset)))))))) (fp.eq (let ((.cse4 (let ((.cse5 (select .cse7 c_~WrapperStruct0_var_1_10_Pointer~0.base))) (concat (select .cse5 .cse6) (select .cse5 c_~WrapperStruct0_var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) (let ((.cse8 (let ((.cse9 (select .cse7 c_~WrapperStruct0_var_1_11_Pointer~0.base))) (concat (select .cse9 .cse2) (select .cse9 c_~WrapperStruct0_var_1_11_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse8) ((_ extract 62 52) .cse8) ((_ extract 51 0) .cse8))))))))) is different from false [2025-03-17 06:16:00,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [635706651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:16:00,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 06:16:00,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2025-03-17 06:16:00,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586715835] [2025-03-17 06:16:00,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 06:16:00,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 06:16:00,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:16:00,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 06:16:00,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=603, Unknown=3, NotChecked=102, Total=812 [2025-03-17 06:16:00,906 INFO L87 Difference]: Start difference. First operand 72 states and 98 transitions. Second operand has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 21 states have internal predecessors, (70), 4 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10)