./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.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-sp_file-3.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 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:00:29,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:00:29,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:00:29,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:00:29,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:00:29,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:00:29,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:00:29,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:00:29,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:00:29,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:00:29,201 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:00:29,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:00:29,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:00:29,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:00:29,202 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:00:29,202 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:00:29,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:00:29,202 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:00:29,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:00:29,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:00:29,203 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:00:29,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:00:29,203 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:00:29,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:00:29,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:00:29,204 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:00:29,204 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 -> 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 [2025-03-08 17:00:29,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:00:29,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:00:29,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:00:29,446 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:00:29,446 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:00:29,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2025-03-08 17:00:30,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bcef977/38d9501d0cdd4d10ae3250a094e74197/FLAGffa028a15 [2025-03-08 17:00:30,856 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:00:30,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2025-03-08 17:00:30,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bcef977/38d9501d0cdd4d10ae3250a094e74197/FLAGffa028a15 [2025-03-08 17:00:31,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5bcef977/38d9501d0cdd4d10ae3250a094e74197 [2025-03-08 17:00:31,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:00:31,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:00:31,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:00:31,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:00:31,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:00:31,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@173f01ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31, skipping insertion in model container [2025-03-08 17:00:31,166 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:00:31,273 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2025-03-08 17:00:31,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:00:31,329 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:00:31,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2025-03-08 17:00:31,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:00:31,386 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:00:31,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31 WrapperNode [2025-03-08 17:00:31,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:00:31,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:00:31,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:00:31,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:00:31,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,423 INFO L138 Inliner]: procedures = 30, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 638 [2025-03-08 17:00:31,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:00:31,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:00:31,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:00:31,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:00:31,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,442 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-08 17:00:31,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,457 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:00:31,467 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:00:31,467 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:00:31,467 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:00:31,468 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (1/1) ... [2025-03-08 17:00:31,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:00:31,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:00:31,496 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 17:00:31,501 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 17:00:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:00:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-08 17:00:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-08 17:00:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-08 17:00:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 17:00:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-08 17:00:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 17:00:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:00:31,515 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:00:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 17:00:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:00:31,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:00:31,628 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:00:31,630 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:00:32,061 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~ite115#1;havoc property_#t~ite114#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short112#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem126#1;havoc property_#t~mem120#1;havoc property_#t~ite123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite140#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~short141#1;havoc property_#t~mem142#1;havoc property_#t~ite179#1;havoc property_#t~mem176#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite151#1;havoc property_#t~mem150#1;havoc property_#t~ite158#1;havoc property_#t~mem152#1;havoc property_#t~ite154#1;havoc property_#t~mem153#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~ite175#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite163#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~ite167#1;havoc property_#t~mem166#1;havoc property_#t~ite174#1;havoc property_#t~mem168#1;havoc property_#t~ite170#1;havoc property_#t~mem169#1;havoc property_#t~mem171#1;havoc property_#t~ite173#1;havoc property_#t~mem172#1;havoc property_#t~mem178#1;havoc property_#t~mem177#1;havoc property_#t~short180#1; [2025-03-08 17:00:32,108 INFO L? ?]: Removed 174 outVars from TransFormulas that were not future-live. [2025-03-08 17:00:32,108 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:00:32,117 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:00:32,117 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:00:32,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:00:32 BoogieIcfgContainer [2025-03-08 17:00:32,118 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:00:32,120 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:00:32,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:00:32,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:00:32,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:00:31" (1/3) ... [2025-03-08 17:00:32,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c90a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:00:32, skipping insertion in model container [2025-03-08 17:00:32,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:00:31" (2/3) ... [2025-03-08 17:00:32,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c90a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:00:32, skipping insertion in model container [2025-03-08 17:00:32,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:00:32" (3/3) ... [2025-03-08 17:00:32,125 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-3.i [2025-03-08 17:00:32,136 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:00:32,138 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-3.i that has 2 procedures, 148 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:00:32,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:00:32,200 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;@24d3eab3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:00:32,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:00:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 130 states have internal predecessors, (188), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 17:00:32,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 17:00:32,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:32,212 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:32,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:32,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:32,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1623673690, now seen corresponding path program 1 times [2025-03-08 17:00:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:32,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162980455] [2025-03-08 17:00:32,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:32,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:32,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 17:00:32,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 17:00:32,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:32,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 17:00:32,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:32,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162980455] [2025-03-08 17:00:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162980455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:00:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996208222] [2025-03-08 17:00:32,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:32,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:00:32,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:00:32,552 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 17:00:32,562 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 17:00:32,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 17:00:32,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 17:00:32,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:32,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:32,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:00:32,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:00:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2025-03-08 17:00:32,811 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:00:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996208222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:32,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:00:32,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 17:00:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518252550] [2025-03-08 17:00:32,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:32,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:00:32,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:32,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:00:32,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:00:32,833 INFO L87 Difference]: Start difference. First operand has 148 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 130 states have internal predecessors, (188), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:32,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:32,852 INFO L93 Difference]: Finished difference Result 290 states and 451 transitions. [2025-03-08 17:00:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:00:32,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-03-08 17:00:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:32,859 INFO L225 Difference]: With dead ends: 290 [2025-03-08 17:00:32,859 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 17:00:32,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 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 17:00:32,864 INFO L435 NwaCegarLoop]: 215 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, 215 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 17:00:32,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:00:32,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 17:00:32,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-08 17:00:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 17:00:32,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2025-03-08 17:00:32,893 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2025-03-08 17:00:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:32,893 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2025-03-08 17:00:32,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2025-03-08 17:00:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 17:00:32,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:32,895 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:32,903 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 17:00:33,096 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 17:00:33,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:33,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash 761092878, now seen corresponding path program 1 times [2025-03-08 17:00:33,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:33,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414179965] [2025-03-08 17:00:33,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:33,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:33,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 17:00:33,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 17:00:33,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:33,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 17:00:33,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:33,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414179965] [2025-03-08 17:00:33,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414179965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:00:33,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945533824] [2025-03-08 17:00:33,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:33,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:00:33,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:00:33,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:00:33,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 17:00:33,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 17:00:33,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 17:00:33,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:33,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:33,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:00:33,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:00:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:33,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:00:33,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945533824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:33,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:00:33,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-08 17:00:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27868610] [2025-03-08 17:00:33,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:33,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:00:33,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:33,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:00:33,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:00:33,805 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:33,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:33,870 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2025-03-08 17:00:33,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:00:33,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-08 17:00:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:33,874 INFO L225 Difference]: With dead ends: 289 [2025-03-08 17:00:33,874 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 17:00:33,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:00:33,876 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:33,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:00:33,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 17:00:33,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-08 17:00:33,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 17:00:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2025-03-08 17:00:33,893 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2025-03-08 17:00:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:33,897 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2025-03-08 17:00:33,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2025-03-08 17:00:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 17:00:33,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:33,901 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:33,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 17:00:34,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 17:00:34,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:34,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:34,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1619723276, now seen corresponding path program 1 times [2025-03-08 17:00:34,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:34,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851638139] [2025-03-08 17:00:34,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:34,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:34,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 17:00:34,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 17:00:34,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:34,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:35,573 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:35,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:35,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851638139] [2025-03-08 17:00:35,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851638139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:35,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:35,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 17:00:35,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664069893] [2025-03-08 17:00:35,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:35,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:00:35,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:35,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:00:35,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 17:00:35,577 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:35,824 INFO L93 Difference]: Finished difference Result 363 states and 538 transitions. [2025-03-08 17:00:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:00:35,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2025-03-08 17:00:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:35,827 INFO L225 Difference]: With dead ends: 363 [2025-03-08 17:00:35,827 INFO L226 Difference]: Without dead ends: 219 [2025-03-08 17:00:35,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:00:35,828 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 61 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:35,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 655 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:00:35,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-08 17:00:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2025-03-08 17:00:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 177 states have (on average 1.4011299435028248) internal successors, (248), 177 states have internal predecessors, (248), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 17:00:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 312 transitions. [2025-03-08 17:00:35,841 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 312 transitions. Word has length 135 [2025-03-08 17:00:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:35,841 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 312 transitions. [2025-03-08 17:00:35,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:35,841 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 312 transitions. [2025-03-08 17:00:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 17:00:35,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:35,844 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:35,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:00:35,845 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:35,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1451429257, now seen corresponding path program 1 times [2025-03-08 17:00:35,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:35,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729764157] [2025-03-08 17:00:35,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:35,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:35,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 17:00:35,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 17:00:35,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:35,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 17:00:37,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729764157] [2025-03-08 17:00:37,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729764157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:00:37,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570392905] [2025-03-08 17:00:37,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:37,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:00:37,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:00:37,016 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:00:37,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 17:00:37,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 17:00:37,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 17:00:37,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:37,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:37,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 17:00:37,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:00:39,298 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 17:00:39,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:00:39,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:00:39,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:00:39,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2025-03-08 17:00:39,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:00:39,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:00:39,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:00:39,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:00:39,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:00:39,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 17:00:39,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2025-03-08 17:00:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:39,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:00:39,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570392905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:39,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:00:39,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 19 [2025-03-08 17:00:39,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891845695] [2025-03-08 17:00:39,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:39,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 17:00:39,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:39,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 17:00:39,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-08 17:00:39,596 INFO L87 Difference]: Start difference. First operand 212 states and 312 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:40,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:40,015 INFO L93 Difference]: Finished difference Result 433 states and 639 transitions. [2025-03-08 17:00:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:00:40,016 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-08 17:00:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:40,017 INFO L225 Difference]: With dead ends: 433 [2025-03-08 17:00:40,017 INFO L226 Difference]: Without dead ends: 289 [2025-03-08 17:00:40,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-03-08 17:00:40,018 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 462 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:40,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1023 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:00:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-03-08 17:00:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 247. [2025-03-08 17:00:40,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 212 states have (on average 1.4150943396226414) internal successors, (300), 212 states have internal predecessors, (300), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 17:00:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 364 transitions. [2025-03-08 17:00:40,035 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 364 transitions. Word has length 136 [2025-03-08 17:00:40,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:40,035 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 364 transitions. [2025-03-08 17:00:40,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 364 transitions. [2025-03-08 17:00:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 17:00:40,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:40,037 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:40,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 17:00:40,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:00:40,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:40,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash -306238105, now seen corresponding path program 1 times [2025-03-08 17:00:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:40,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115306952] [2025-03-08 17:00:40,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:40,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 17:00:40,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 17:00:40,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:40,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:40,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:40,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115306952] [2025-03-08 17:00:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115306952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:40,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:00:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633996290] [2025-03-08 17:00:40,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:40,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:00:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:40,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:00:40,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:00:40,316 INFO L87 Difference]: Start difference. First operand 247 states and 364 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:40,360 INFO L93 Difference]: Finished difference Result 537 states and 795 transitions. [2025-03-08 17:00:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:00:40,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2025-03-08 17:00:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:40,362 INFO L225 Difference]: With dead ends: 537 [2025-03-08 17:00:40,363 INFO L226 Difference]: Without dead ends: 358 [2025-03-08 17:00:40,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:00:40,365 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 113 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:40,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 455 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:00:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-03-08 17:00:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 306. [2025-03-08 17:00:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 271 states have (on average 1.4354243542435425) internal successors, (389), 271 states have internal predecessors, (389), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 17:00:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 453 transitions. [2025-03-08 17:00:40,395 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 453 transitions. Word has length 136 [2025-03-08 17:00:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:40,396 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 453 transitions. [2025-03-08 17:00:40,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 453 transitions. [2025-03-08 17:00:40,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 17:00:40,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:40,397 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:40,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:00:40,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:40,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1808772960, now seen corresponding path program 1 times [2025-03-08 17:00:40,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:40,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177125674] [2025-03-08 17:00:40,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:40,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:40,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 17:00:40,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 17:00:40,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:40,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:40,541 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 17:00:40,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177125674] [2025-03-08 17:00:40,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177125674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:00:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416078100] [2025-03-08 17:00:40,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:00:40,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:00:40,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:00:40,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 17:00:40,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 17:00:40,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 17:00:40,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:40,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:40,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:00:40,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:00:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:40,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:00:40,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416078100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:40,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:00:40,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-08 17:00:40,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286990179] [2025-03-08 17:00:40,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:40,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:00:40,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:40,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:00:40,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:00:40,763 INFO L87 Difference]: Start difference. First operand 306 states and 453 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:40,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:40,797 INFO L93 Difference]: Finished difference Result 546 states and 811 transitions. [2025-03-08 17:00:40,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:00:40,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 137 [2025-03-08 17:00:40,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:40,799 INFO L225 Difference]: With dead ends: 546 [2025-03-08 17:00:40,799 INFO L226 Difference]: Without dead ends: 312 [2025-03-08 17:00:40,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:00:40,800 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:40,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:00:40,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-03-08 17:00:40,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-03-08 17:00:40,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 273 states have (on average 1.4322344322344323) internal successors, (391), 273 states have internal predecessors, (391), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-08 17:00:40,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 455 transitions. [2025-03-08 17:00:40,814 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 455 transitions. Word has length 137 [2025-03-08 17:00:40,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:40,814 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 455 transitions. [2025-03-08 17:00:40,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 455 transitions. [2025-03-08 17:00:40,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 17:00:40,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:40,815 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:40,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 17:00:41,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:00:41,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:41,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:41,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1815831217, now seen corresponding path program 1 times [2025-03-08 17:00:41,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:41,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360043482] [2025-03-08 17:00:41,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:41,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:41,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 17:00:41,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 17:00:41,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:41,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:42,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:42,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360043482] [2025-03-08 17:00:42,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360043482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:42,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:42,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 17:00:42,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722053556] [2025-03-08 17:00:42,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:42,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 17:00:42,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:42,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 17:00:42,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 17:00:42,051 INFO L87 Difference]: Start difference. First operand 308 states and 455 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:42,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:42,268 INFO L93 Difference]: Finished difference Result 777 states and 1156 transitions. [2025-03-08 17:00:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:00:42,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 137 [2025-03-08 17:00:42,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:42,272 INFO L225 Difference]: With dead ends: 777 [2025-03-08 17:00:42,272 INFO L226 Difference]: Without dead ends: 541 [2025-03-08 17:00:42,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 17:00:42,273 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 294 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:42,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 670 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:00:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-08 17:00:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 475. [2025-03-08 17:00:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 423 states have (on average 1.4373522458628842) internal successors, (608), 423 states have internal predecessors, (608), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 17:00:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 704 transitions. [2025-03-08 17:00:42,309 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 704 transitions. Word has length 137 [2025-03-08 17:00:42,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:42,311 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 704 transitions. [2025-03-08 17:00:42,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 704 transitions. [2025-03-08 17:00:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 17:00:42,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:42,313 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:42,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 17:00:42,313 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:42,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1034999142, now seen corresponding path program 1 times [2025-03-08 17:00:42,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:42,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385906593] [2025-03-08 17:00:42,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:42,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:42,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 17:00:42,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 17:00:42,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:42,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:42,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:42,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385906593] [2025-03-08 17:00:42,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385906593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:42,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:42,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:00:42,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19494018] [2025-03-08 17:00:42,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:42,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:00:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:42,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:00:42,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:00:42,836 INFO L87 Difference]: Start difference. First operand 475 states and 704 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:43,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:43,246 INFO L93 Difference]: Finished difference Result 915 states and 1357 transitions. [2025-03-08 17:00:43,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:00:43,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-08 17:00:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:43,250 INFO L225 Difference]: With dead ends: 915 [2025-03-08 17:00:43,250 INFO L226 Difference]: Without dead ends: 679 [2025-03-08 17:00:43,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:00:43,252 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 562 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:43,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 819 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:00:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2025-03-08 17:00:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 535. [2025-03-08 17:00:43,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 483 states have (on average 1.445134575569358) internal successors, (698), 483 states have internal predecessors, (698), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 17:00:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 794 transitions. [2025-03-08 17:00:43,288 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 794 transitions. Word has length 138 [2025-03-08 17:00:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:43,289 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 794 transitions. [2025-03-08 17:00:43,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 794 transitions. [2025-03-08 17:00:43,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 17:00:43,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:43,293 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:43,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 17:00:43,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:43,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2112925728, now seen corresponding path program 1 times [2025-03-08 17:00:43,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:43,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588239004] [2025-03-08 17:00:43,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:43,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:43,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 17:00:43,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 17:00:43,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:43,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:43,424 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 17:00:43,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:43,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588239004] [2025-03-08 17:00:43,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588239004] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:00:43,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297573861] [2025-03-08 17:00:43,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:43,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:00:43,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:00:43,426 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:00:43,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 17:00:43,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 17:00:43,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 17:00:43,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:43,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:43,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:00:43,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:00:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:43,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:00:43,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297573861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:43,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 17:00:43,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-03-08 17:00:43,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827186360] [2025-03-08 17:00:43,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:43,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 17:00:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:43,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 17:00:43,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:00:43,645 INFO L87 Difference]: Start difference. First operand 535 states and 794 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:43,676 INFO L93 Difference]: Finished difference Result 1004 states and 1493 transitions. [2025-03-08 17:00:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 17:00:43,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-08 17:00:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:43,679 INFO L225 Difference]: With dead ends: 1004 [2025-03-08 17:00:43,679 INFO L226 Difference]: Without dead ends: 541 [2025-03-08 17:00:43,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:00:43,680 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 0 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:43,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 832 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:00:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-08 17:00:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-03-08 17:00:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 489 states have (on average 1.4396728016359919) internal successors, (704), 489 states have internal predecessors, (704), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 17:00:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 800 transitions. [2025-03-08 17:00:43,706 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 800 transitions. Word has length 138 [2025-03-08 17:00:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:43,707 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 800 transitions. [2025-03-08 17:00:43,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 800 transitions. [2025-03-08 17:00:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-08 17:00:43,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:43,709 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:43,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 17:00:43,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:00:43,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:43,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:43,914 INFO L85 PathProgramCache]: Analyzing trace with hash -337626228, now seen corresponding path program 1 times [2025-03-08 17:00:43,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:43,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867592643] [2025-03-08 17:00:43,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:43,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:43,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-08 17:00:43,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-08 17:00:43,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:43,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:44,382 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:44,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:44,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867592643] [2025-03-08 17:00:44,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867592643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:44,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:44,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:00:44,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184466830] [2025-03-08 17:00:44,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:44,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:00:44,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:44,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:00:44,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:00:44,384 INFO L87 Difference]: Start difference. First operand 541 states and 800 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:44,682 INFO L93 Difference]: Finished difference Result 990 states and 1461 transitions. [2025-03-08 17:00:44,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:00:44,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2025-03-08 17:00:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:44,685 INFO L225 Difference]: With dead ends: 990 [2025-03-08 17:00:44,685 INFO L226 Difference]: Without dead ends: 691 [2025-03-08 17:00:44,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:00:44,686 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 581 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:44,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 935 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 17:00:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2025-03-08 17:00:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 601. [2025-03-08 17:00:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 549 states have (on average 1.4462659380692167) internal successors, (794), 549 states have internal predecessors, (794), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 17:00:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 890 transitions. [2025-03-08 17:00:44,712 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 890 transitions. Word has length 138 [2025-03-08 17:00:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:44,712 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 890 transitions. [2025-03-08 17:00:44,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 890 transitions. [2025-03-08 17:00:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 17:00:44,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:44,713 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:44,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 17:00:44,714 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash -476994462, now seen corresponding path program 1 times [2025-03-08 17:00:44,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:44,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850847514] [2025-03-08 17:00:44,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:44,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:44,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 17:00:44,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 17:00:44,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:44,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:44,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:44,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850847514] [2025-03-08 17:00:44,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850847514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:44,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:44,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:00:44,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560302686] [2025-03-08 17:00:44,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:44,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:00:44,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:44,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:00:44,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:00:44,773 INFO L87 Difference]: Start difference. First operand 601 states and 890 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:44,847 INFO L93 Difference]: Finished difference Result 1207 states and 1782 transitions. [2025-03-08 17:00:44,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:00:44,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2025-03-08 17:00:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:44,850 INFO L225 Difference]: With dead ends: 1207 [2025-03-08 17:00:44,850 INFO L226 Difference]: Without dead ends: 678 [2025-03-08 17:00:44,851 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:00:44,851 INFO L435 NwaCegarLoop]: 314 mSDtfsCounter, 104 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:44,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 510 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 17:00:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2025-03-08 17:00:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 574. [2025-03-08 17:00:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 522 states have (on average 1.4233716475095786) internal successors, (743), 522 states have internal predecessors, (743), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 17:00:44,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 839 transitions. [2025-03-08 17:00:44,874 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 839 transitions. Word has length 139 [2025-03-08 17:00:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:44,875 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 839 transitions. [2025-03-08 17:00:44,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:00:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 839 transitions. [2025-03-08 17:00:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 17:00:44,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:44,876 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:44,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 17:00:44,876 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:44,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash 818777004, now seen corresponding path program 1 times [2025-03-08 17:00:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352816423] [2025-03-08 17:00:44,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:44,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 17:00:44,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 17:00:44,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:44,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:46,624 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:46,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:46,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352816423] [2025-03-08 17:00:46,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352816423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:46,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:46,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 17:00:46,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679391410] [2025-03-08 17:00:46,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:46,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:00:46,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:46,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:00:46,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:00:46,626 INFO L87 Difference]: Start difference. First operand 574 states and 839 transitions. Second operand has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 17:00:47,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:47,772 INFO L93 Difference]: Finished difference Result 1331 states and 1943 transitions. [2025-03-08 17:00:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:00:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 139 [2025-03-08 17:00:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:47,777 INFO L225 Difference]: With dead ends: 1331 [2025-03-08 17:00:47,777 INFO L226 Difference]: Without dead ends: 829 [2025-03-08 17:00:47,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-03-08 17:00:47,779 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 523 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:47,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1940 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 17:00:47,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2025-03-08 17:00:47,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 740. [2025-03-08 17:00:47,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 688 states have (on average 1.430232558139535) internal successors, (984), 688 states have internal predecessors, (984), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-08 17:00:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1080 transitions. [2025-03-08 17:00:47,817 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1080 transitions. Word has length 139 [2025-03-08 17:00:47,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:47,818 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1080 transitions. [2025-03-08 17:00:47,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 17:00:47,818 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1080 transitions. [2025-03-08 17:00:47,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 17:00:47,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:47,820 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:47,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 17:00:47,820 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:47,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:47,820 INFO L85 PathProgramCache]: Analyzing trace with hash -978174355, now seen corresponding path program 1 times [2025-03-08 17:00:47,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:47,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984626955] [2025-03-08 17:00:47,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:47,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:47,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 17:00:47,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 17:00:47,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:47,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:48,417 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:48,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:48,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984626955] [2025-03-08 17:00:48,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984626955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:48,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:48,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:00:48,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945660307] [2025-03-08 17:00:48,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:48,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:00:48,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:48,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:00:48,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:00:48,419 INFO L87 Difference]: Start difference. First operand 740 states and 1080 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:48,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:48,783 INFO L93 Difference]: Finished difference Result 1536 states and 2233 transitions. [2025-03-08 17:00:48,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:00:48,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-03-08 17:00:48,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:48,789 INFO L225 Difference]: With dead ends: 1536 [2025-03-08 17:00:48,789 INFO L226 Difference]: Without dead ends: 868 [2025-03-08 17:00:48,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:00:48,791 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 512 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:48,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 790 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 17:00:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-03-08 17:00:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 864. [2025-03-08 17:00:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 793 states have (on average 1.4148802017654476) internal successors, (1122), 795 states have internal predecessors, (1122), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 17:00:48,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1250 transitions. [2025-03-08 17:00:48,840 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1250 transitions. Word has length 139 [2025-03-08 17:00:48,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:48,840 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1250 transitions. [2025-03-08 17:00:48,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1250 transitions. [2025-03-08 17:00:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 17:00:48,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:48,841 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:48,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 17:00:48,842 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:48,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash 409952779, now seen corresponding path program 1 times [2025-03-08 17:00:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:48,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578374642] [2025-03-08 17:00:48,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:48,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 17:00:48,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 17:00:48,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:48,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:49,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:49,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578374642] [2025-03-08 17:00:49,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578374642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:49,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:49,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 17:00:49,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435067927] [2025-03-08 17:00:49,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:49,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:00:49,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:49,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:00:49,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:00:49,467 INFO L87 Difference]: Start difference. First operand 864 states and 1250 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:49,919 INFO L93 Difference]: Finished difference Result 1831 states and 2649 transitions. [2025-03-08 17:00:49,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:00:49,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2025-03-08 17:00:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:49,925 INFO L225 Difference]: With dead ends: 1831 [2025-03-08 17:00:49,925 INFO L226 Difference]: Without dead ends: 1043 [2025-03-08 17:00:49,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 17:00:49,927 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 276 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:49,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 928 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:00:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2025-03-08 17:00:49,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 922. [2025-03-08 17:00:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 922 states, 851 states have (on average 1.4159811985898942) internal successors, (1205), 853 states have internal predecessors, (1205), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 17:00:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1333 transitions. [2025-03-08 17:00:49,986 INFO L78 Accepts]: Start accepts. Automaton has 922 states and 1333 transitions. Word has length 139 [2025-03-08 17:00:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:49,986 INFO L471 AbstractCegarLoop]: Abstraction has 922 states and 1333 transitions. [2025-03-08 17:00:49,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:49,986 INFO L276 IsEmpty]: Start isEmpty. Operand 922 states and 1333 transitions. [2025-03-08 17:00:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 17:00:49,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:49,987 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:49,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 17:00:49,988 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:49,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:49,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1386998580, now seen corresponding path program 1 times [2025-03-08 17:00:49,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:49,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270763334] [2025-03-08 17:00:49,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:49,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:50,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 17:00:50,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 17:00:50,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:50,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:51,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:51,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270763334] [2025-03-08 17:00:51,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270763334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:51,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:51,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-08 17:00:51,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575248908] [2025-03-08 17:00:51,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:51,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 17:00:51,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:51,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 17:00:51,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:00:51,648 INFO L87 Difference]: Start difference. First operand 922 states and 1333 transitions. Second operand has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 17:00:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:52,834 INFO L93 Difference]: Finished difference Result 1852 states and 2680 transitions. [2025-03-08 17:00:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 17:00:52,835 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 139 [2025-03-08 17:00:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:52,838 INFO L225 Difference]: With dead ends: 1852 [2025-03-08 17:00:52,838 INFO L226 Difference]: Without dead ends: 1006 [2025-03-08 17:00:52,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-08 17:00:52,841 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 264 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:52,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 2116 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 17:00:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-03-08 17:00:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 917. [2025-03-08 17:00:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 846 states have (on average 1.41725768321513) internal successors, (1199), 848 states have internal predecessors, (1199), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 17:00:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1327 transitions. [2025-03-08 17:00:52,880 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1327 transitions. Word has length 139 [2025-03-08 17:00:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:52,880 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1327 transitions. [2025-03-08 17:00:52,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 17:00:52,881 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1327 transitions. [2025-03-08 17:00:52,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 17:00:52,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:52,882 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:52,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 17:00:52,882 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:52,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1910221506, now seen corresponding path program 1 times [2025-03-08 17:00:52,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:52,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626518399] [2025-03-08 17:00:52,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:52,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:52,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 17:00:52,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 17:00:52,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:52,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:54,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:54,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626518399] [2025-03-08 17:00:54,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626518399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:54,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:54,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-08 17:00:54,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664600203] [2025-03-08 17:00:54,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:54,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 17:00:54,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:54,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 17:00:54,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-08 17:00:54,502 INFO L87 Difference]: Start difference. First operand 917 states and 1327 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 17:00:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:55,431 INFO L93 Difference]: Finished difference Result 1682 states and 2433 transitions. [2025-03-08 17:00:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 17:00:55,431 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 140 [2025-03-08 17:00:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:55,435 INFO L225 Difference]: With dead ends: 1682 [2025-03-08 17:00:55,435 INFO L226 Difference]: Without dead ends: 1173 [2025-03-08 17:00:55,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2025-03-08 17:00:55,436 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 813 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 1428 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:55,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 1428 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 17:00:55,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2025-03-08 17:00:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 978. [2025-03-08 17:00:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 907 states have (on average 1.420066152149945) internal successors, (1288), 909 states have internal predecessors, (1288), 64 states have call successors, (64), 6 states have call predecessors, (64), 6 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-08 17:00:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1416 transitions. [2025-03-08 17:00:55,483 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1416 transitions. Word has length 140 [2025-03-08 17:00:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:55,483 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1416 transitions. [2025-03-08 17:00:55,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 17:00:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1416 transitions. [2025-03-08 17:00:55,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 17:00:55,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:55,485 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:55,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 17:00:55,485 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:55,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:55,485 INFO L85 PathProgramCache]: Analyzing trace with hash -936801953, now seen corresponding path program 1 times [2025-03-08 17:00:55,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:55,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495139811] [2025-03-08 17:00:55,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:55,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:55,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 17:00:55,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 17:00:55,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:55,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:00:56,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495139811] [2025-03-08 17:00:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495139811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:00:56,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:00:56,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 17:00:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599324840] [2025-03-08 17:00:56,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:00:56,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:00:56,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:00:56,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:00:56,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:00:56,763 INFO L87 Difference]: Start difference. First operand 978 states and 1416 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:57,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:00:57,420 INFO L93 Difference]: Finished difference Result 1656 states and 2393 transitions. [2025-03-08 17:00:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 17:00:57,421 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2025-03-08 17:00:57,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:00:57,424 INFO L225 Difference]: With dead ends: 1656 [2025-03-08 17:00:57,424 INFO L226 Difference]: Without dead ends: 1086 [2025-03-08 17:00:57,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-08 17:00:57,426 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 367 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:00:57,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 776 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 17:00:57,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2025-03-08 17:00:57,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1082. [2025-03-08 17:00:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1001 states have (on average 1.4115884115884116) internal successors, (1413), 1005 states have internal predecessors, (1413), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-08 17:00:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1557 transitions. [2025-03-08 17:00:57,522 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1557 transitions. Word has length 140 [2025-03-08 17:00:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:00:57,522 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1557 transitions. [2025-03-08 17:00:57,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:00:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1557 transitions. [2025-03-08 17:00:57,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 17:00:57,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:00:57,528 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:00:57,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 17:00:57,529 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:00:57,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:00:57,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1832936321, now seen corresponding path program 1 times [2025-03-08 17:00:57,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:00:57,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406748801] [2025-03-08 17:00:57,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:57,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:00:57,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 17:00:57,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 17:00:57,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:57,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-03-08 17:00:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:00:58,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406748801] [2025-03-08 17:00:58,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406748801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:00:58,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580799580] [2025-03-08 17:00:58,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:00:58,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:00:58,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:00:58,574 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 17:00:58,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 17:00:58,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 17:00:58,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 17:00:58,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:00:58,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:00:58,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-08 17:00:58,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:00:58,887 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 49 treesize of output 48 [2025-03-08 17:00:59,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 78 [2025-03-08 17:00:59,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 17:00:59,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 17:00:59,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 17:01:00,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 17:01:00,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 17:01:00,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 17:01:00,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 17:01:00,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 17:01:01,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-08 17:01:01,479 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 60 treesize of output 42 [2025-03-08 17:01:01,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 58 [2025-03-08 17:01:01,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2025-03-08 17:01:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 152 proven. 93 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 17:01:01,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:01:01,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580799580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:01:01,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 17:01:01,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2025-03-08 17:01:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167805479] [2025-03-08 17:01:01,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 17:01:01,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 17:01:01,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:01:01,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 17:01:01,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=551, Unknown=12, NotChecked=0, Total=650 [2025-03-08 17:01:01,790 INFO L87 Difference]: Start difference. First operand 1082 states and 1557 transitions. Second operand has 21 states, 19 states have (on average 6.684210526315789) internal successors, (127), 21 states have internal predecessors, (127), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-08 17:01:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:01:04,612 INFO L93 Difference]: Finished difference Result 2585 states and 3681 transitions. [2025-03-08 17:01:04,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 17:01:04,613 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.684210526315789) internal successors, (127), 21 states have internal predecessors, (127), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) Word has length 142 [2025-03-08 17:01:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:01:04,617 INFO L225 Difference]: With dead ends: 2585 [2025-03-08 17:01:04,617 INFO L226 Difference]: Without dead ends: 1523 [2025-03-08 17:01:04,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 183 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=753, Invalid=3141, Unknown=12, NotChecked=0, Total=3906 [2025-03-08 17:01:04,619 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 2137 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2138 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 17:01:04,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2138 Valid, 1973 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 17:01:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-03-08 17:01:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 988. [2025-03-08 17:01:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 931 states have (on average 1.4070891514500536) internal successors, (1310), 935 states have internal predecessors, (1310), 46 states have call successors, (46), 10 states have call predecessors, (46), 10 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-08 17:01:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1402 transitions. [2025-03-08 17:01:04,698 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1402 transitions. Word has length 142 [2025-03-08 17:01:04,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:01:04,699 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1402 transitions. [2025-03-08 17:01:04,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.684210526315789) internal successors, (127), 21 states have internal predecessors, (127), 8 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 6 states have call predecessors, (32), 8 states have call successors, (32) [2025-03-08 17:01:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1402 transitions. [2025-03-08 17:01:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 17:01:04,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:01:04,704 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:01:04,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 17:01:04,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 17:01:04,905 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:01:04,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:01:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash 57607685, now seen corresponding path program 1 times [2025-03-08 17:01:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:01:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983502124] [2025-03-08 17:01:04,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:01:04,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:01:04,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 17:01:04,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 17:01:04,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:01:04,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:01:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:01:06,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:01:06,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983502124] [2025-03-08 17:01:06,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983502124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:01:06,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:01:06,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:01:06,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134665626] [2025-03-08 17:01:06,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:01:06,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:01:06,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:01:06,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:01:06,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:01:06,187 INFO L87 Difference]: Start difference. First operand 988 states and 1402 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 17:01:06,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:01:06,844 INFO L93 Difference]: Finished difference Result 1854 states and 2627 transitions. [2025-03-08 17:01:06,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:01:06,845 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 142 [2025-03-08 17:01:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:01:06,849 INFO L225 Difference]: With dead ends: 1854 [2025-03-08 17:01:06,849 INFO L226 Difference]: Without dead ends: 1246 [2025-03-08 17:01:06,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-08 17:01:06,851 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 604 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 17:01:06,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 1124 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 17:01:06,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-03-08 17:01:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 1055. [2025-03-08 17:01:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1055 states, 1001 states have (on average 1.4115884115884116) internal successors, (1413), 1004 states have internal predecessors, (1413), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2025-03-08 17:01:06,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1055 states to 1055 states and 1501 transitions. [2025-03-08 17:01:06,909 INFO L78 Accepts]: Start accepts. Automaton has 1055 states and 1501 transitions. Word has length 142 [2025-03-08 17:01:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:01:06,910 INFO L471 AbstractCegarLoop]: Abstraction has 1055 states and 1501 transitions. [2025-03-08 17:01:06,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 17:01:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1055 states and 1501 transitions. [2025-03-08 17:01:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 17:01:06,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:01:06,912 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:01:06,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 17:01:06,913 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:01:06,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:01:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash 144990053, now seen corresponding path program 1 times [2025-03-08 17:01:06,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:01:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152931396] [2025-03-08 17:01:06,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:01:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:01:06,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 17:01:06,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 17:01:06,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:01:06,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:01:08,217 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:01:08,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:01:08,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152931396] [2025-03-08 17:01:08,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152931396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:01:08,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:01:08,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 17:01:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138488686] [2025-03-08 17:01:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:01:08,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 17:01:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:01:08,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 17:01:08,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 17:01:08,219 INFO L87 Difference]: Start difference. First operand 1055 states and 1501 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 17:01:08,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:01:08,808 INFO L93 Difference]: Finished difference Result 2151 states and 3054 transitions. [2025-03-08 17:01:08,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 17:01:08,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 143 [2025-03-08 17:01:08,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:01:08,812 INFO L225 Difference]: With dead ends: 2151 [2025-03-08 17:01:08,812 INFO L226 Difference]: Without dead ends: 1099 [2025-03-08 17:01:08,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-03-08 17:01:08,814 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 581 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 582 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 17:01:08,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [582 Valid, 867 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 17:01:08,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-03-08 17:01:08,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1013. [2025-03-08 17:01:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1013 states, 961 states have (on average 1.4068678459937565) internal successors, (1352), 963 states have internal predecessors, (1352), 42 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-08 17:01:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1013 states to 1013 states and 1436 transitions. [2025-03-08 17:01:08,871 INFO L78 Accepts]: Start accepts. Automaton has 1013 states and 1436 transitions. Word has length 143 [2025-03-08 17:01:08,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:01:08,871 INFO L471 AbstractCegarLoop]: Abstraction has 1013 states and 1436 transitions. [2025-03-08 17:01:08,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 10 states have internal predecessors, (66), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-08 17:01:08,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1436 transitions. [2025-03-08 17:01:08,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 17:01:08,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:01:08,873 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:01:08,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 17:01:08,873 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:01:08,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:01:08,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1592933890, now seen corresponding path program 1 times [2025-03-08 17:01:08,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:01:08,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367908832] [2025-03-08 17:01:08,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:01:08,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:01:08,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 17:01:08,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 17:01:08,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:01:08,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:01:08,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 17:01:08,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 17:01:08,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 17:01:08,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:01:08,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 17:01:09,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 17:01:09,060 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 17:01:09,061 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 17:01:09,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 17:01:09,066 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:01:09,196 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 17:01:09,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 05:01:09 BoogieIcfgContainer [2025-03-08 17:01:09,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 17:01:09,199 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 17:01:09,199 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 17:01:09,199 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 17:01:09,200 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:00:32" (3/4) ... [2025-03-08 17:01:09,201 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 17:01:09,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 17:01:09,203 INFO L158 Benchmark]: Toolchain (without parser) took 38043.71ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 124.6MB in the beginning and 488.9MB in the end (delta: -364.4MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2025-03-08 17:01:09,203 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:01:09,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.84ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 108.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 17:01:09,203 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.81ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 104.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:01:09,203 INFO L158 Benchmark]: Boogie Preprocessor took 42.08ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 102.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 17:01:09,205 INFO L158 Benchmark]: IcfgBuilder took 651.04ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 59.5MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-08 17:01:09,206 INFO L158 Benchmark]: TraceAbstraction took 37078.46ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 58.8MB in the beginning and 489.0MB in the end (delta: -430.3MB). Peak memory consumption was 289.9MB. Max. memory is 16.1GB. [2025-03-08 17:01:09,206 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 604.0MB. Free memory was 489.0MB in the beginning and 488.9MB in the end (delta: 126.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 17:01:09,207 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.21ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.84ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 108.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.81ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 104.6MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.08ms. Allocated memory is still 167.8MB. Free memory was 104.6MB in the beginning and 102.2MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 651.04ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 59.5MB in the end (delta: 42.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 37078.46ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 58.8MB in the beginning and 489.0MB in the end (delta: -430.3MB). Peak memory consumption was 289.9MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 604.0MB. Free memory was 489.0MB in the beginning and 488.9MB in the end (delta: 126.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 51, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 131. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 0, -64, -5, 500, -5, -100, 1, 127.5, 15.75, -0.5, 5.25, 8.5 }; [L55] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L57] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L58] signed long int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L59] signed long int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L60] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L61] signed long int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L62] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L63] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L64] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L65] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L66] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L67] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L68] double* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L69] unsigned char last_1_WrapperStruct00_var_1_11 = 1; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=0, last_1_WrapperStruct00_var_1_11=1] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L128] EXPR WrapperStruct00.var_1_11 [L128] last_1_WrapperStruct00_var_1_11 = WrapperStruct00.var_1_11 [L138] RET updateLastVariables() [L139] CALL updateVariables() [L100] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L103] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L106] WrapperStruct00.var_1_7 = __VERIFIER_nondet_long() [L107] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L109] WrapperStruct00.var_1_8 = __VERIFIER_nondet_long() [L110] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1073741823) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L112] WrapperStruct00.var_1_9 = __VERIFIER_nondet_long() [L113] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 536870912) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L115] WrapperStruct00.var_1_10 = __VERIFIER_nondet_long() [L116] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 536870911) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L118] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] EXPR (WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L119] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L120] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L121] EXPR WrapperStruct00.var_1_14 [L121] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_14 [L121] EXPR WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] EXPR (WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L122] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L123] EXPR WrapperStruct00.var_1_15 [L123] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F [L123] EXPR WrapperStruct00.var_1_15 [L123] EXPR WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] EXPR (WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L123] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_double() [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F [L125] EXPR WrapperStruct00.var_1_16 [L125] EXPR WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] EXPR (WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] CALL assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L125] RET assume_abort_if_not((WrapperStruct00.var_1_16 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_16 <= -1.0e-20F) || (WrapperStruct00.var_1_16 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_16 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L139] RET updateVariables() [L140] CALL step() [L73] unsigned char stepLocal_0 = last_1_WrapperStruct00_var_1_11; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L74] COND FALSE !(! last_1_WrapperStruct00_var_1_11) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1] [L79] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L79] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_7_Pointer)); [L80] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L80] signed long int stepLocal_1 = (*(WrapperStruct00_var_1_10_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=6, stepLocal_2=9] [L81] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) <= stepLocal_2) [L88] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=6] [L88] COND FALSE !(! (*(WrapperStruct00_var_1_11_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=6] [L91] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) [L91] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L91] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=6] [L91] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L91] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L91] (*(WrapperStruct00_var_1_6_Pointer)) = (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))) [L93] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1, stepLocal_0=1, stepLocal_1=6] [L93] COND FALSE !((*(WrapperStruct00_var_1_4_Pointer))) [L96] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L96] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L140] RET step() [L141] CALL, EXPR property() [L131] EXPR (! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer)))))) [L131] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) [L131] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) [L131] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L131] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L131] EXPR (! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1) [L131] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_7_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) [L131] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR (*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer)))) [L131] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L131] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L131] EXPR (*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131] EXPR ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L131-L132] return ((((! last_1_WrapperStruct00_var_1_11) ? ((last_1_WrapperStruct00_var_1_11 && last_1_WrapperStruct00_var_1_11) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))))) : 1) : 1) && ((! (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))))) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed long int) (((((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) + (*(WrapperStruct00_var_1_10_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))))) && (((*(WrapperStruct00_var_1_8_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer))) ? (((*(WrapperStruct00_var_1_10_Pointer)) >= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_1_Pointer)) || (! (*(WrapperStruct00_var_1_5_Pointer))))))) : 1)) && ((*(WrapperStruct00_var_1_4_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((((((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) < ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))))))) ? (((((((*(WrapperStruct00_var_1_13_Pointer))) > ((*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer))) : ((*(WrapperStruct00_var_1_14_Pointer))))) + (*(WrapperStruct00_var_1_15_Pointer)))) : ((((((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) < 0 ) ? -((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer))))) : ((((3.5) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (3.5) : ((*(WrapperStruct00_var_1_16_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) (*(WrapperStruct00_var_1_15_Pointer))))) ; [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:19}, WrapperStruct00_var_1_11_Pointer={4:23}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_16_Pointer={4:56}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:1}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:3}, WrapperStruct00_var_1_7_Pointer={4:7}, WrapperStruct00_var_1_8_Pointer={4:11}, WrapperStruct00_var_1_9_Pointer={4:15}, isInitial=1, last_1_WrapperStruct00_var_1_11=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 148 locations, 236 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.9s, OverallIterations: 21, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8260 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8254 mSDsluCounter, 19517 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15195 mSDsCounter, 810 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8088 IncrementalHoareTripleChecker+Invalid, 8898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 810 mSolverCounterUnsat, 4322 mSDtfsCounter, 8088 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1225 GetRequests, 970 SyntacticMatches, 9 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1416 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1082occurred in iteration=17, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 1823 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 21.2s InterpolantComputationTime, 3725 NumberOfCodeBlocks, 3725 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3556 ConstructedInterpolants, 0 QuantifiedInterpolants, 38611 SizeOfPredicates, 20 NumberOfNonLiveVariables, 3260 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 26 InterpolantComputations, 19 PerfectInterpolantSequences, 12150/12480 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 17:01:09,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.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 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 17:01:11,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:01:11,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 17:01:11,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:01:11,142 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:01:11,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:01:11,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:01:11,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:01:11,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:01:11,174 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:01:11,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:01:11,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:01:11,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:01:11,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:01:11,174 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:01:11,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:01:11,175 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:01:11,181 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:01:11,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:01:11,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:01:11,182 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 -> 963153236bfee4fba7310de151468b7ab2713ef3b9442c5a0ed9bd52a1f2d263 [2025-03-08 17:01:11,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:01:11,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:01:11,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:01:11,431 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:01:11,431 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:01:11,432 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2025-03-08 17:01:12,631 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5859430c8/51dcb9e4b7a549b9a1834c71793134f9/FLAGaaa22858a [2025-03-08 17:01:12,838 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:01:12,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i [2025-03-08 17:01:12,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5859430c8/51dcb9e4b7a549b9a1834c71793134f9/FLAGaaa22858a [2025-03-08 17:01:12,873 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5859430c8/51dcb9e4b7a549b9a1834c71793134f9 [2025-03-08 17:01:12,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:01:12,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:01:12,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:01:12,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:01:12,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:01:12,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:01:12" (1/1) ... [2025-03-08 17:01:12,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64147108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:12, skipping insertion in model container [2025-03-08 17:01:12,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:01:12" (1/1) ... [2025-03-08 17:01:12,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:01:13,015 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2025-03-08 17:01:13,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:01:13,106 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:01:13,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-3.i[916,929] [2025-03-08 17:01:13,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:01:13,164 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:01:13,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13 WrapperNode [2025-03-08 17:01:13,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:01:13,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:01:13,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:01:13,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:01:13,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,183 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,220 INFO L138 Inliner]: procedures = 34, calls = 179, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 633 [2025-03-08 17:01:13,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:01:13,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:01:13,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:01:13,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:01:13,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,258 INFO L175 MemorySlicer]: Split 152 memory accesses to 2 slices as follows [2, 150]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2025-03-08 17:01:13,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:01:13,306 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:01:13,306 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:01:13,306 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:01:13,307 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (1/1) ... [2025-03-08 17:01:13,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:01:13,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:01:13,333 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 17:01:13,338 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 17:01:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:01:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-08 17:01:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-08 17:01:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-08 17:01:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 17:01:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:01:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-08 17:01:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-08 17:01:13,473 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:01:13,474 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:01:15,000 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L131: havoc property_#t~ite115#1;havoc property_#t~ite114#1;havoc property_#t~mem113#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short112#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem119#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem126#1;havoc property_#t~mem120#1;havoc property_#t~ite123#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem124#1;havoc property_#t~mem125#1;havoc property_#t~short128#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~ite140#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~ite139#1;havoc property_#t~mem134#1;havoc property_#t~mem133#1;havoc property_#t~mem138#1;havoc property_#t~mem136#1;havoc property_#t~mem135#1;havoc property_#t~short137#1;havoc property_#t~short141#1;havoc property_#t~mem142#1;havoc property_#t~ite179#1;havoc property_#t~mem176#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~ite147#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~ite151#1;havoc property_#t~mem150#1;havoc property_#t~ite158#1;havoc property_#t~mem152#1;havoc property_#t~ite154#1;havoc property_#t~mem153#1;havoc property_#t~mem155#1;havoc property_#t~ite157#1;havoc property_#t~mem156#1;havoc property_#t~ite175#1;havoc property_#t~mem159#1;havoc property_#t~mem160#1;havoc property_#t~ite163#1;havoc property_#t~mem161#1;havoc property_#t~mem162#1;havoc property_#t~mem164#1;havoc property_#t~mem165#1;havoc property_#t~ite167#1;havoc property_#t~mem166#1;havoc property_#t~ite174#1;havoc property_#t~mem168#1;havoc property_#t~ite170#1;havoc property_#t~mem169#1;havoc property_#t~mem171#1;havoc property_#t~ite173#1;havoc property_#t~mem172#1;havoc property_#t~mem178#1;havoc property_#t~mem177#1;havoc property_#t~short180#1; [2025-03-08 17:01:15,031 INFO L? ?]: Removed 192 outVars from TransFormulas that were not future-live. [2025-03-08 17:01:15,032 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:01:15,039 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:01:15,039 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:01:15,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:01:15 BoogieIcfgContainer [2025-03-08 17:01:15,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:01:15,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:01:15,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:01:15,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:01:15,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:01:12" (1/3) ... [2025-03-08 17:01:15,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1359bf66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:01:15, skipping insertion in model container [2025-03-08 17:01:15,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:01:13" (2/3) ... [2025-03-08 17:01:15,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1359bf66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:01:15, skipping insertion in model container [2025-03-08 17:01:15,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:01:15" (3/3) ... [2025-03-08 17:01:15,049 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-3.i [2025-03-08 17:01:15,058 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:01:15,059 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-3.i that has 2 procedures, 148 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 17:01:15,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:01:15,100 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;@1e3ddf6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:01:15,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 17:01:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 130 states have internal predecessors, (188), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 17:01:15,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 17:01:15,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:01:15,115 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:01:15,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:01:15,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:01:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash -55988482, now seen corresponding path program 1 times [2025-03-08 17:01:15,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:01:15,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593993866] [2025-03-08 17:01:15,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:01:15,126 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 17:01:15,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:01:15,128 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 17:01:15,129 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 17:01:15,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 17:01:15,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 17:01:15,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:01:15,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:01:15,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 17:01:15,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:01:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2025-03-08 17:01:15,471 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:01:15,472 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:01:15,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593993866] [2025-03-08 17:01:15,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593993866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:01:15,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:01:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 17:01:15,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503394892] [2025-03-08 17:01:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:01:15,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 17:01:15,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:01:15,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 17:01:15,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 17:01:15,494 INFO L87 Difference]: Start difference. First operand has 148 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 130 states have internal predecessors, (188), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:01:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:01:15,522 INFO L93 Difference]: Finished difference Result 290 states and 451 transitions. [2025-03-08 17:01:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 17:01:15,524 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2025-03-08 17:01:15,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:01:15,530 INFO L225 Difference]: With dead ends: 290 [2025-03-08 17:01:15,530 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 17:01:15,533 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 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 17:01:15,536 INFO L435 NwaCegarLoop]: 215 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, 215 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 17:01:15,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:01:15,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 17:01:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-03-08 17:01:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 127 states have (on average 1.4409448818897639) internal successors, (183), 127 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 17:01:15,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 215 transitions. [2025-03-08 17:01:15,584 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 215 transitions. Word has length 133 [2025-03-08 17:01:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:01:15,584 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 215 transitions. [2025-03-08 17:01:15,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-08 17:01:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 215 transitions. [2025-03-08 17:01:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 17:01:15,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:01:15,590 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:01:15,599 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 17:01:15,791 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 17:01:15,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:01:15,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:01:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash -918569294, now seen corresponding path program 1 times [2025-03-08 17:01:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:01:15,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228370942] [2025-03-08 17:01:15,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:01:15,792 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 17:01:15,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:01:15,794 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 17:01:15,795 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 17:01:15,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 17:01:16,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 17:01:16,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:01:16,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:01:16,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 17:01:16,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:01:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:01:16,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:01:16,105 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:01:16,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228370942] [2025-03-08 17:01:16,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228370942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:01:16,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:01:16,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:01:16,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807675404] [2025-03-08 17:01:16,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:01:16,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:01:16,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:01:16,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:01:16,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:01:16,108 INFO L87 Difference]: Start difference. First operand 145 states and 215 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:01:16,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 17:01:16,161 INFO L93 Difference]: Finished difference Result 289 states and 430 transitions. [2025-03-08 17:01:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:01:16,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2025-03-08 17:01:16,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 17:01:16,163 INFO L225 Difference]: With dead ends: 289 [2025-03-08 17:01:16,163 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 17:01:16,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:01:16,165 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 17:01:16,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 628 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 17:01:16,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 17:01:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2025-03-08 17:01:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.434108527131783) internal successors, (185), 129 states have internal predecessors, (185), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-08 17:01:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2025-03-08 17:01:16,174 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 133 [2025-03-08 17:01:16,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 17:01:16,175 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2025-03-08 17:01:16,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:01:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2025-03-08 17:01:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 17:01:16,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 17:01:16,185 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:01:16,194 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 17:01:16,385 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 17:01:16,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 17:01:16,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:01:16,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1922887888, now seen corresponding path program 1 times [2025-03-08 17:01:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 17:01:16,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242808147] [2025-03-08 17:01:16,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:01:16,387 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 17:01:16,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 17:01:16,390 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 17:01:16,391 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 17:01:16,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 17:01:16,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 17:01:16,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:01:16,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:01:16,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 17:01:16,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:01:19,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2025-03-08 17:01:19,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2025-03-08 17:01:21,275 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-03-08 17:01:21,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 17:01:21,276 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 17:01:21,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242808147] [2025-03-08 17:01:21,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242808147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:01:21,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:01:21,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 17:01:21,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854421931] [2025-03-08 17:01:21,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:01:21,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:01:21,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 17:01:21,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:01:21,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=41, Unknown=1, NotChecked=0, Total=56 [2025-03-08 17:01:21,279 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2025-03-08 17:01:26,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:01:28,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:01:30,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:01:33,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:01:36,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:01:38,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:01:40,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:01:43,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:01:45,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:01:47,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 17:01:49,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]