./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.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 e8eac1f6ce4b453c986bcf223e7a999b8cc2242bbb25b7afe262387bc06640cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:54:50,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:54:50,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:54:50,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:54:50,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:54:50,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:54:50,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:54:50,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:54:50,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:54:50,204 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:54:50,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:54:50,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:54:50,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:54:50,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:54:50,205 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:54:50,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:54:50,205 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:54:50,206 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:54:50,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:54:50,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:54:50,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:54:50,207 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:54:50,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:54:50,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:54:50,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:54:50,207 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:54:50,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:54:50,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:54:50,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:54:50,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:54:50,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:54:50,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:54:50,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:54:50,208 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 -> e8eac1f6ce4b453c986bcf223e7a999b8cc2242bbb25b7afe262387bc06640cd [2025-03-08 16:54:50,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:54:50,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:54:50,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:54:50,457 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:54:50,457 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:54:50,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i [2025-03-08 16:54:51,596 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844bf36e3/48b14d75a1b24cfa8df16423555be2be/FLAG65379f708 [2025-03-08 16:54:51,800 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:54:51,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i [2025-03-08 16:54:51,807 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844bf36e3/48b14d75a1b24cfa8df16423555be2be/FLAG65379f708 [2025-03-08 16:54:52,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844bf36e3/48b14d75a1b24cfa8df16423555be2be [2025-03-08 16:54:52,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:54:52,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:54:52,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:54:52,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:54:52,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:54:52,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc8c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52, skipping insertion in model container [2025-03-08 16:54:52,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:54:52,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i[916,929] [2025-03-08 16:54:52,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:54:52,344 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:54:52,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i[916,929] [2025-03-08 16:54:52,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:54:52,413 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:54:52,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52 WrapperNode [2025-03-08 16:54:52,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:54:52,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:54:52,415 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:54:52,415 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:54:52,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,482 INFO L138 Inliner]: procedures = 30, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 575 [2025-03-08 16:54:52,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:54:52,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:54:52,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:54:52,485 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:54:52,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,509 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 16:54:52,511 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,512 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,529 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,536 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:54:52,545 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:54:52,545 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:54:52,545 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:54:52,546 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (1/1) ... [2025-03-08 16:54:52,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:54:52,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:54:52,569 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:54:52,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:54:52,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:54:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 16:54:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 16:54:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 16:54:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 16:54:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 16:54:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 16:54:52,588 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:54:52,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:54:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 16:54:52,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:54:52,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:54:52,680 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:54:52,681 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:54:53,102 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~ite141#1;havoc property_#t~mem127#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~ite137#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite150#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem146#1;havoc property_#t~short148#1;havoc property_#t~short151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short154#1;havoc property_#t~ite164#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~ite161#1;havoc property_#t~mem158#1;havoc property_#t~mem157#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short165#1; [2025-03-08 16:54:53,142 INFO L? ?]: Removed 150 outVars from TransFormulas that were not future-live. [2025-03-08 16:54:53,143 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:54:53,154 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:54:53,154 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:54:53,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:53 BoogieIcfgContainer [2025-03-08 16:54:53,154 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:54:53,157 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:54:53,157 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:54:53,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:54:53,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:54:52" (1/3) ... [2025-03-08 16:54:53,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0a1811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:53, skipping insertion in model container [2025-03-08 16:54:53,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:54:52" (2/3) ... [2025-03-08 16:54:53,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0a1811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:54:53, skipping insertion in model container [2025-03-08 16:54:53,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:53" (3/3) ... [2025-03-08 16:54:53,163 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-74.i [2025-03-08 16:54:53,173 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:54:53,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-74.i that has 2 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:54:53,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:54:53,230 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;@4ed9351c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:54:53,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:54:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:54:53,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:54:53,245 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:53,246 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:53,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1664839216, now seen corresponding path program 1 times [2025-03-08 16:54:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:53,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743154631] [2025-03-08 16:54:53,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:53,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:53,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:54:53,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:54:53,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:53,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:54:53,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743154631] [2025-03-08 16:54:53,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743154631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:54:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778657257] [2025-03-08 16:54:53,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:53,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:54:53,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:54:53,544 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:54:53,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:54:53,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:54:53,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:54:53,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:53,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:53,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:54:53,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:54:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-08 16:54:53,771 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:54:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778657257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:54:53,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:54:53,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309341872] [2025-03-08 16:54:53,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:53,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:54:53,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:53,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:54:53,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:54:53,794 INFO L87 Difference]: Start difference. First operand has 124 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:54:53,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:53,813 INFO L93 Difference]: Finished difference Result 242 states and 378 transitions. [2025-03-08 16:54:53,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:54:53,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-03-08 16:54:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:53,818 INFO L225 Difference]: With dead ends: 242 [2025-03-08 16:54:53,818 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 16:54:53,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:54:53,822 INFO L435 NwaCegarLoop]: 178 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, 178 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:53,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:54:53,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 16:54:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-08 16:54:53,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:54:53,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2025-03-08 16:54:53,853 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 150 [2025-03-08 16:54:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:53,855 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2025-03-08 16:54:53,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:54:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2025-03-08 16:54:53,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:54:53,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:53,858 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:53,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 16:54:54,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:54:54,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:54,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:54,059 INFO L85 PathProgramCache]: Analyzing trace with hash 841672179, now seen corresponding path program 1 times [2025-03-08 16:54:54,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:54,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663973873] [2025-03-08 16:54:54,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:54,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:54,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:54:54,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:54:54,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:54,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:54:54,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:54,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663973873] [2025-03-08 16:54:54,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663973873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:54,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:54,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:54:54,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580532986] [2025-03-08 16:54:54,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:54,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:54:54,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:54,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:54:54,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:54:54,751 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:54:55,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:55,099 INFO L93 Difference]: Finished difference Result 315 states and 469 transitions. [2025-03-08 16:54:55,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:54:55,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-03-08 16:54:55,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:55,102 INFO L225 Difference]: With dead ends: 315 [2025-03-08 16:54:55,102 INFO L226 Difference]: Without dead ends: 197 [2025-03-08 16:54:55,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:54:55,103 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 66 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:55,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 327 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 16:54:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-08 16:54:55,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 122. [2025-03-08 16:54:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 103 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:54:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2025-03-08 16:54:55,123 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 150 [2025-03-08 16:54:55,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:55,125 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 179 transitions. [2025-03-08 16:54:55,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:54:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2025-03-08 16:54:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:54:55,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:55,127 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:55,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:54:55,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:55,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1235537164, now seen corresponding path program 1 times [2025-03-08 16:54:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:55,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296597949] [2025-03-08 16:54:55,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:55,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:54:55,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:54:55,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:55,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:54:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:54:56,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:54:56,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296597949] [2025-03-08 16:54:56,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296597949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:54:56,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:54:56,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 16:54:56,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533699790] [2025-03-08 16:54:56,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:54:56,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 16:54:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:54:56,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 16:54:56,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 16:54:56,875 INFO L87 Difference]: Start difference. First operand 122 states and 179 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:54:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:54:57,441 INFO L93 Difference]: Finished difference Result 311 states and 455 transitions. [2025-03-08 16:54:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 16:54:57,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-03-08 16:54:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:54:57,443 INFO L225 Difference]: With dead ends: 311 [2025-03-08 16:54:57,444 INFO L226 Difference]: Without dead ends: 192 [2025-03-08 16:54:57,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-08 16:54:57,446 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 89 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 16:54:57,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1004 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 16:54:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-08 16:54:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2025-03-08 16:54:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 165 states have (on average 1.4181818181818182) internal successors, (234), 166 states have internal predecessors, (234), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 16:54:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2025-03-08 16:54:57,464 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 150 [2025-03-08 16:54:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:54:57,464 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2025-03-08 16:54:57,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 8 states have internal predecessors, (68), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:54:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2025-03-08 16:54:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:54:57,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:54:57,470 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:54:57,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:54:57,470 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:54:57,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:54:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1432050669, now seen corresponding path program 1 times [2025-03-08 16:54:57,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:54:57,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120988152] [2025-03-08 16:54:57,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:54:57,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:54:57,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:54:57,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:54:57,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:57,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:54:57,586 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:54:57,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:54:57,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:54:57,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:54:57,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:54:57,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:54:57,698 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:54:57,699 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:54:57,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:54:57,703 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 16:54:57,752 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:54:57,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:54:57 BoogieIcfgContainer [2025-03-08 16:54:57,754 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:54:57,755 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:54:57,755 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:54:57,755 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:54:57,755 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:54:53" (3/4) ... [2025-03-08 16:54:57,757 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:54:57,758 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:54:57,758 INFO L158 Benchmark]: Toolchain (without parser) took 5598.82ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 112.6MB in the beginning and 510.6MB in the end (delta: -398.0MB). Peak memory consumption was 49.9MB. Max. memory is 16.1GB. [2025-03-08 16:54:57,758 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:54:57,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.38ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 95.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:54:57,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.20ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 91.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:54:57,759 INFO L158 Benchmark]: Boogie Preprocessor took 59.86ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 88.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:54:57,759 INFO L158 Benchmark]: IcfgBuilder took 610.68ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 52.8MB in the end (delta: 35.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 16:54:57,759 INFO L158 Benchmark]: TraceAbstraction took 4596.84ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 52.3MB in the beginning and 510.7MB in the end (delta: -458.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:54:57,760 INFO L158 Benchmark]: Witness Printer took 3.03ms. Allocated memory is still 587.2MB. Free memory was 510.7MB in the beginning and 510.6MB in the end (delta: 84.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:54:57,761 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.22ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.38ms. Allocated memory is still 142.6MB. Free memory was 112.1MB in the beginning and 95.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.20ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 91.2MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.86ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 88.3MB in the end (delta: 2.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 610.68ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 52.8MB in the end (delta: 35.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4596.84ms. Allocated memory was 142.6MB in the beginning and 587.2MB in the end (delta: 444.6MB). Free memory was 52.3MB in the beginning and 510.7MB in the end (delta: -458.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.03ms. Allocated memory is still 587.2MB. Free memory was 510.7MB in the beginning and 510.6MB in the end (delta: 84.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 someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 123. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 25, 63.25, 3.779, 31.6, 100.5, 64, 3150951169, 128, 1, 1, 9.3, 0, 1, 1 }; [L55] unsigned char last_1_WrapperStruct00_var_1_16 = 1; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_16=1] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L120] EXPR WrapperStruct00.var_1_16 [L120] last_1_WrapperStruct00_var_1_16 = WrapperStruct00.var_1_16 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L90] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_2 [L91] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_2 [L91] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L91] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L92] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_3 [L93] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L93] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L94] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_4 [L95] EXPR WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L95] EXPR (WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L96] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L97] EXPR WrapperStruct00.var_1_5 [L97] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_5 [L97] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L97] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ulong() [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ulong() [L102] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L103] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L104] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L106] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L107] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ulong() [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L111] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L112] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L114] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L115] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L117] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L131] RET updateVariables() [L132] CALL step() [L59] unsigned char stepLocal_0 = last_1_WrapperStruct00_var_1_16 && last_1_WrapperStruct00_var_1_16; [L60] EXPR WrapperStruct00.var_1_5 [L60] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1, stepLocal_0=1] [L60] COND TRUE (WrapperStruct00.var_1_5 > WrapperStruct00.var_1_11) || stepLocal_0 [L61] EXPR WrapperStruct00.var_1_14 [L61] WrapperStruct00.var_1_10 = WrapperStruct00.var_1_14 [L65] EXPR WrapperStruct00.var_1_10 [L65] unsigned char stepLocal_1 = WrapperStruct00.var_1_10; [L66] stepLocal_1 && WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L66] COND FALSE !(stepLocal_1 && WrapperStruct00.var_1_10) [L73] EXPR WrapperStruct00.var_1_15 [L73] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_15 [L75] EXPR WrapperStruct00.var_1_2 [L75] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L75] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L75] EXPR WrapperStruct00.var_1_2 [L75] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L75] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L75] EXPR ((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4) [L75] EXPR WrapperStruct00.var_1_4 [L75] EXPR ((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L75] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L75] COND FALSE !(((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) [L78] EXPR WrapperStruct00.var_1_2 [L78] EXPR WrapperStruct00.var_1_3 [L78] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L78] COND FALSE !(WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) [L85] EXPR WrapperStruct00.var_1_6 [L85] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR WrapperStruct00.var_1_2 [L123] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) [L123] EXPR WrapperStruct00.var_1_2 [L123] EXPR ((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR ((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4) [L123] EXPR WrapperStruct00.var_1_4 [L123] EXPR ((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR (((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)))))) : ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) ? ((WrapperStruct00.var_1_4 > (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6))) [L123] EXPR WrapperStruct00.var_1_1 [L123] EXPR WrapperStruct00.var_1_6 [L123] EXPR WrapperStruct00.var_1_7 [L123] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR ((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) [L123] EXPR WrapperStruct00.var_1_7 [L123] EXPR WrapperStruct00.var_1_8 [L123] EXPR ((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR (((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)))))) : ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) ? ((WrapperStruct00.var_1_4 > (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR ((((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)))))) : ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) ? ((WrapperStruct00.var_1_4 > (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)))) && (((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_11) || (last_1_WrapperStruct00_var_1_16 && last_1_WrapperStruct00_var_1_16)) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_10 == ((unsigned char) (WrapperStruct00.var_1_14 && (! WrapperStruct00.var_1_15))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123] EXPR (((((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)))))) : ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) ? ((WrapperStruct00.var_1_4 > (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)))) && (((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_11) || (last_1_WrapperStruct00_var_1_16 && last_1_WrapperStruct00_var_1_16)) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_10 == ((unsigned char) (WrapperStruct00.var_1_14 && (! WrapperStruct00.var_1_15)))))) && ((WrapperStruct00.var_1_10 && WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_4 < (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L123-L124] return (((((((((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) < (WrapperStruct00.var_1_4)) ? (((((WrapperStruct00.var_1_2) > (WrapperStruct00.var_1_3)) ? (WrapperStruct00.var_1_2) : (WrapperStruct00.var_1_3)))) : (WrapperStruct00.var_1_4))) < WrapperStruct00.var_1_5) ? (WrapperStruct00.var_1_1 == ((unsigned long int) ((((WrapperStruct00.var_1_6) > ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8))) ? (WrapperStruct00.var_1_6) : ((WrapperStruct00.var_1_7 - WrapperStruct00.var_1_8)))))) : ((WrapperStruct00.var_1_2 >= (WrapperStruct00.var_1_3 + WrapperStruct00.var_1_5)) ? ((WrapperStruct00.var_1_4 > (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_9))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_6)))) && (((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_11) || (last_1_WrapperStruct00_var_1_16 && last_1_WrapperStruct00_var_1_16)) ? (WrapperStruct00.var_1_10 == ((unsigned char) WrapperStruct00.var_1_14)) : (WrapperStruct00.var_1_10 == ((unsigned char) (WrapperStruct00.var_1_14 && (! WrapperStruct00.var_1_15)))))) && ((WrapperStruct00.var_1_10 && WrapperStruct00.var_1_10) ? ((WrapperStruct00.var_1_4 < (- WrapperStruct00.var_1_5)) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15)) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15))) : (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_15))) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_16=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 200 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 4, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 173 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 155 mSDsluCounter, 1509 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1013 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 771 IncrementalHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 496 mSDtfsCounter, 771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=3, InterpolantAutomatonStates: 14, 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, 3 MinimizatonAttempts, 78 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 541 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 2144/2176 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:54:57,780 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-s_file-74.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 e8eac1f6ce4b453c986bcf223e7a999b8cc2242bbb25b7afe262387bc06640cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:54:59,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:54:59,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:54:59,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:54:59,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:54:59,758 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:54:59,759 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:54:59,759 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:54:59,760 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:54:59,760 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:54:59,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:54:59,761 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:54:59,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:54:59,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:54:59,762 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:54:59,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:54:59,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:54:59,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:54:59,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:54:59,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:54:59,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:54:59,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:54:59,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:54:59,762 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:54:59,763 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:54:59,763 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:54:59,763 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:54:59,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:54:59,763 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:54:59,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:54:59,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:54:59,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:54:59,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:54:59,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:54:59,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:54:59,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:54:59,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:54:59,764 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:54:59,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:54:59,764 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:54:59,765 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:54:59,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:54:59,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:54:59,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:54:59,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:54:59,765 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 -> e8eac1f6ce4b453c986bcf223e7a999b8cc2242bbb25b7afe262387bc06640cd [2025-03-08 16:55:00,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:55:00,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:55:00,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:55:00,023 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:55:00,024 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:55:00,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i [2025-03-08 16:55:01,252 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc85da0ce/5f253372a09c47fe8e410b65dd5942c5/FLAGb413d742b [2025-03-08 16:55:01,426 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:55:01,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i [2025-03-08 16:55:01,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc85da0ce/5f253372a09c47fe8e410b65dd5942c5/FLAGb413d742b [2025-03-08 16:55:01,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc85da0ce/5f253372a09c47fe8e410b65dd5942c5 [2025-03-08 16:55:01,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:55:01,451 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:55:01,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:55:01,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:55:01,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:55:01,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d172c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01, skipping insertion in model container [2025-03-08 16:55:01,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:55:01,582 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i[916,929] [2025-03-08 16:55:01,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:55:01,655 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:55:01,664 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-74.i[916,929] [2025-03-08 16:55:01,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:55:01,712 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:55:01,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01 WrapperNode [2025-03-08 16:55:01,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:55:01,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:55:01,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:55:01,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:55:01,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,757 INFO L138 Inliner]: procedures = 34, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 574 [2025-03-08 16:55:01,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:55:01,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:55:01,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:55:01,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:55:01,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,785 INFO L175 MemorySlicer]: Split 153 memory accesses to 2 slices as follows [2, 151]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2025-03-08 16:55:01,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,786 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,810 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:55:01,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:55:01,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:55:01,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:55:01,820 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (1/1) ... [2025-03-08 16:55:01,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:55:01,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:55:01,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:55:01,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-08 16:55:01,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-08 16:55:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-08 16:55:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:55:01,866 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:55:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:55:01,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:55:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 16:55:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 16:55:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 16:55:01,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 16:55:01,970 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:55:01,973 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:55:04,617 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite110#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~mem117#1;havoc property_#t~mem119#1;havoc property_#t~ite141#1;havoc property_#t~mem127#1;havoc property_#t~mem122#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~mem130#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite140#1;havoc property_#t~mem132#1;havoc property_#t~mem131#1;havoc property_#t~ite137#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite150#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~mem149#1;havoc property_#t~mem147#1;havoc property_#t~mem146#1;havoc property_#t~short148#1;havoc property_#t~short151#1;havoc property_#t~mem152#1;havoc property_#t~mem153#1;havoc property_#t~short154#1;havoc property_#t~ite164#1;havoc property_#t~mem156#1;havoc property_#t~mem155#1;havoc property_#t~ite161#1;havoc property_#t~mem158#1;havoc property_#t~mem157#1;havoc property_#t~mem160#1;havoc property_#t~mem159#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short165#1; [2025-03-08 16:55:04,650 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-03-08 16:55:04,650 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:55:04,658 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:55:04,658 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:55:04,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:55:04 BoogieIcfgContainer [2025-03-08 16:55:04,658 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:55:04,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:55:04,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:55:04,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:55:04,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:55:01" (1/3) ... [2025-03-08 16:55:04,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481d9824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:55:04, skipping insertion in model container [2025-03-08 16:55:04,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:55:01" (2/3) ... [2025-03-08 16:55:04,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481d9824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:55:04, skipping insertion in model container [2025-03-08 16:55:04,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:55:04" (3/3) ... [2025-03-08 16:55:04,665 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-74.i [2025-03-08 16:55:04,674 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:55:04,675 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-74.i that has 2 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:55:04,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:55:04,724 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;@9e97b17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:55:04,725 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:55:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:55:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:55:04,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:04,742 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:55:04,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:04,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1508094602, now seen corresponding path program 1 times [2025-03-08 16:55:04,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:04,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734636952] [2025-03-08 16:55:04,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:04,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:55:04,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:04,766 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:55:04,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:55:04,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:55:05,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:55:05,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:05,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:05,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:55:05,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-08 16:55:05,196 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:05,196 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:05,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734636952] [2025-03-08 16:55:05,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734636952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:05,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:05,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:55:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124541309] [2025-03-08 16:55:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:05,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:55:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:05,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:55:05,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:55:05,216 INFO L87 Difference]: Start difference. First operand has 124 states, 104 states have (on average 1.4326923076923077) internal successors, (149), 105 states have internal predecessors, (149), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:55:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:05,235 INFO L93 Difference]: Finished difference Result 242 states and 378 transitions. [2025-03-08 16:55:05,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:55:05,237 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-03-08 16:55:05,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:05,242 INFO L225 Difference]: With dead ends: 242 [2025-03-08 16:55:05,242 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 16:55:05,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:55:05,247 INFO L435 NwaCegarLoop]: 178 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, 178 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:05,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:55:05,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 16:55:05,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-08 16:55:05,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.411764705882353) internal successors, (144), 102 states have internal predecessors, (144), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:55:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2025-03-08 16:55:05,282 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 150 [2025-03-08 16:55:05,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:05,283 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2025-03-08 16:55:05,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 16:55:05,283 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2025-03-08 16:55:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:55:05,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:05,285 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:55:05,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:55:05,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:55:05,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:05,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 998416793, now seen corresponding path program 1 times [2025-03-08 16:55:05,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996586532] [2025-03-08 16:55:05,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:05,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:55:05,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:05,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:55:05,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:55:05,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:55:05,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:55:05,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:05,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:05,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 16:55:05,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:55:05,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:05,970 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996586532] [2025-03-08 16:55:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996586532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:05,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:55:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836955507] [2025-03-08 16:55:05,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:05,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 16:55:05,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:05,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 16:55:05,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 16:55:05,972 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:55:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:07,735 INFO L93 Difference]: Finished difference Result 240 states and 355 transitions. [2025-03-08 16:55:07,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 16:55:07,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-03-08 16:55:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:07,737 INFO L225 Difference]: With dead ends: 240 [2025-03-08 16:55:07,737 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 16:55:07,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:55:07,738 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:07,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 432 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 16:55:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 16:55:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-08 16:55:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 103 states have internal predecessors, (145), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-08 16:55:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 179 transitions. [2025-03-08 16:55:07,750 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 179 transitions. Word has length 150 [2025-03-08 16:55:07,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:07,753 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 179 transitions. [2025-03-08 16:55:07,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:55:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 179 transitions. [2025-03-08 16:55:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:55:07,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:07,754 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:55:07,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 16:55:07,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:55:07,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:07,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:07,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1078792550, now seen corresponding path program 1 times [2025-03-08 16:55:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:07,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674301205] [2025-03-08 16:55:07,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:07,957 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:55:07,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:07,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:55:07,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:55:08,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:55:08,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:55:08,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:08,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:08,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 16:55:08,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:08,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:55:08,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2025-03-08 16:55:08,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:08,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2025-03-08 16:55:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-08 16:55:08,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:08,517 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:08,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674301205] [2025-03-08 16:55:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674301205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:08,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 16:55:08,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153134896] [2025-03-08 16:55:08,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:08,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 16:55:08,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:08,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 16:55:08,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:55:08,519 INFO L87 Difference]: Start difference. First operand 122 states and 179 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:55:09,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:55:12,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:55:12,442 INFO L93 Difference]: Finished difference Result 311 states and 455 transitions. [2025-03-08 16:55:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 16:55:12,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 150 [2025-03-08 16:55:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:55:12,445 INFO L225 Difference]: With dead ends: 311 [2025-03-08 16:55:12,445 INFO L226 Difference]: Without dead ends: 192 [2025-03-08 16:55:12,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 16:55:12,446 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 88 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-03-08 16:55:12,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 905 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-03-08 16:55:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-08 16:55:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2025-03-08 16:55:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 165 states have (on average 1.4181818181818182) internal successors, (234), 166 states have internal predecessors, (234), 21 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 16:55:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2025-03-08 16:55:12,456 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 150 [2025-03-08 16:55:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:55:12,457 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2025-03-08 16:55:12,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-08 16:55:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2025-03-08 16:55:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:55:12,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:55:12,459 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:55:12,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 16:55:12,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:55:12,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:55:12,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:55:12,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1275306055, now seen corresponding path program 1 times [2025-03-08 16:55:12,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:55:12,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539023604] [2025-03-08 16:55:12,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:55:12,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:55:12,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:55:12,663 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:55:12,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 16:55:12,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:55:13,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:55:13,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:55:13,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:55:13,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-08 16:55:13,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:55:13,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-08 16:55:13,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 79 [2025-03-08 16:55:14,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 125 [2025-03-08 16:55:16,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 347 treesize of output 209 [2025-03-08 16:55:18,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:18,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 478 treesize of output 255 [2025-03-08 16:55:20,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:20,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 478 treesize of output 255 [2025-03-08 16:55:21,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:21,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 478 treesize of output 255 [2025-03-08 16:55:22,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:22,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 478 treesize of output 255 [2025-03-08 16:55:24,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:24,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 489 treesize of output 255 [2025-03-08 16:55:25,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:25,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 478 treesize of output 255 [2025-03-08 16:55:27,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:27,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 478 treesize of output 255 [2025-03-08 16:55:28,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:28,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 480 treesize of output 275 [2025-03-08 16:55:29,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:29,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 383 treesize of output 238 [2025-03-08 16:55:35,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:55:35,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 678 treesize of output 317 [2025-03-08 16:55:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:55:37,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:55:37,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:55:37,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539023604] [2025-03-08 16:55:37,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539023604] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:55:37,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:55:37,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2025-03-08 16:55:37,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88222602] [2025-03-08 16:55:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:55:37,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 16:55:37,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:55:37,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 16:55:37,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-03-08 16:55:37,899 INFO L87 Difference]: Start difference. First operand 189 states and 276 transitions. Second operand has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 16:55:39,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:55:40,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-08 16:56:08,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:56:08,621 INFO L93 Difference]: Finished difference Result 1104 states and 1604 transitions. [2025-03-08 16:56:08,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 16:56:08,622 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 150 [2025-03-08 16:56:08,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:56:08,627 INFO L225 Difference]: With dead ends: 1104 [2025-03-08 16:56:08,627 INFO L226 Difference]: Without dead ends: 918 [2025-03-08 16:56:08,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 117 SyntacticMatches, 8 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2025-03-08 16:56:08,628 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1118 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 2698 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.9s IncrementalHoareTripleChecker+Time [2025-03-08 16:56:08,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 996 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2698 Invalid, 0 Unknown, 0 Unchecked, 29.9s Time] [2025-03-08 16:56:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2025-03-08 16:56:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 468. [2025-03-08 16:56:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 364 states have (on average 1.3626373626373627) internal successors, (496), 372 states have internal predecessors, (496), 93 states have call successors, (93), 10 states have call predecessors, (93), 10 states have return successors, (93), 85 states have call predecessors, (93), 93 states have call successors, (93) [2025-03-08 16:56:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 682 transitions. [2025-03-08 16:56:08,677 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 682 transitions. Word has length 150 [2025-03-08 16:56:08,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:56:08,677 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 682 transitions. [2025-03-08 16:56:08,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.9615384615384617) internal successors, (77), 25 states have internal predecessors, (77), 4 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-08 16:56:08,677 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 682 transitions. [2025-03-08 16:56:08,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 16:56:08,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:56:08,680 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:56:08,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-08 16:56:08,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:56:08,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:56:08,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:56:08,885 INFO L85 PathProgramCache]: Analyzing trace with hash 981604952, now seen corresponding path program 1 times [2025-03-08 16:56:08,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:56:08,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610035488] [2025-03-08 16:56:08,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:56:08,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:56:08,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:56:08,888 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:56:08,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 16:56:08,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 16:56:09,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 16:56:09,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:56:09,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:56:09,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 16:56:09,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:56:09,523 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 20 treesize of output 21 [2025-03-08 16:56:09,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 67 [2025-03-08 16:56:10,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:10,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 265 treesize of output 145 [2025-03-08 16:56:14,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:14,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 178 treesize of output 121 [2025-03-08 16:56:22,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:22,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 182 treesize of output 124 [2025-03-08 16:56:22,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:22,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 182 treesize of output 124 [2025-03-08 16:56:23,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:23,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 182 treesize of output 124 [2025-03-08 16:56:23,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:23,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 182 treesize of output 124 [2025-03-08 16:56:24,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 16:56:24,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 183 treesize of output 144