./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-2.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 c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:48:00,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:48:00,433 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:48:00,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:48:00,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:48:00,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:48:00,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:48:00,458 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:48:00,458 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:48:00,458 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:48:00,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:48:00,458 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:48:00,458 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:48:00,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:48:00,458 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:48:00,459 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:48:00,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:48:00,460 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:48:00,460 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:48:00,460 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:48:00,461 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:48:00,461 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:48:00,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:48:00,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:48:00,461 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:48:00,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:48:00,461 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:48:00,461 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:48:00,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:48:00,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:48:00,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:48:00,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:48:00,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:48:00,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:48:00,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:48:00,462 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:48:00,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:48:00,463 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:48:00,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:48:00,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:48:00,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:48:00,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:48:00,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:48:00,463 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 -> c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec [2025-03-04 01:48:00,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:48:00,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:48:00,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:48:00,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:48:00,712 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:48:00,714 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-2.i [2025-03-04 01:48:01,829 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70154b8a0/f92a189b31214782805b8706fa4fc7c1/FLAG2c4b6cf83 [2025-03-04 01:48:02,044 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:48:02,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i [2025-03-04 01:48:02,050 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70154b8a0/f92a189b31214782805b8706fa4fc7c1/FLAG2c4b6cf83 [2025-03-04 01:48:02,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70154b8a0/f92a189b31214782805b8706fa4fc7c1 [2025-03-04 01:48:02,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:48:02,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:48:02,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:48:02,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:48:02,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:48:02,066 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@526c2332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02, skipping insertion in model container [2025-03-04 01:48:02,067 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:48:02,179 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-2.i[916,929] [2025-03-04 01:48:02,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:48:02,238 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:48:02,247 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-2.i[916,929] [2025-03-04 01:48:02,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:48:02,286 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:48:02,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02 WrapperNode [2025-03-04 01:48:02,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:48:02,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:48:02,288 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:48:02,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:48:02,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,344 INFO L138 Inliner]: procedures = 30, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 519 [2025-03-04 01:48:02,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:48:02,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:48:02,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:48:02,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:48:02,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,370 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:48:02,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,387 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:48:02,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:48:02,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:48:02,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:48:02,402 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (1/1) ... [2025-03-04 01:48:02,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:48:02,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:48:02,431 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-04 01:48:02,433 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-04 01:48:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:48:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:48:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:48:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:48:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:48:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:48:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:48:02,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:48:02,450 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:48:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:48:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:48:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:48:02,555 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:48:02,558 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:48:02,955 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem90#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite99#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~bitwise110#1;havoc property_#t~ite123#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite143#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~short144#1; [2025-03-04 01:48:02,990 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-04 01:48:02,990 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:48:03,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:48:03,000 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:48:03,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:48:03 BoogieIcfgContainer [2025-03-04 01:48:03,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:48:03,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:48:03,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:48:03,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:48:03,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:48:02" (1/3) ... [2025-03-04 01:48:03,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bda92b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:48:03, skipping insertion in model container [2025-03-04 01:48:03,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:02" (2/3) ... [2025-03-04 01:48:03,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bda92b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:48:03, skipping insertion in model container [2025-03-04 01:48:03,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:48:03" (3/3) ... [2025-03-04 01:48:03,011 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-2.i [2025-03-04 01:48:03,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:48:03,022 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-2.i that has 2 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:48:03,060 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:48:03,067 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;@559f2f20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:48:03,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:48:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:48:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:48:03,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:03,077 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:03,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:03,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:03,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1238954935, now seen corresponding path program 1 times [2025-03-04 01:48:03,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:03,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821688695] [2025-03-04 01:48:03,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:03,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:03,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:48:03,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:48:03,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:03,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 01:48:03,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:03,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821688695] [2025-03-04 01:48:03,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821688695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:48:03,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022729684] [2025-03-04 01:48:03,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:03,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:48:03,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:48:03,353 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-04 01:48:03,355 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-04 01:48:03,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:48:03,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:48:03,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:03,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:03,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:48:03,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-04 01:48:03,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:03,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022729684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:03,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:48:03,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:48:03,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453610545] [2025-03-04 01:48:03,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:03,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:48:03,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:03,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:48:03,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:48:03,616 INFO L87 Difference]: Start difference. First operand has 103 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 89 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:48:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:03,641 INFO L93 Difference]: Finished difference Result 200 states and 311 transitions. [2025-03-04 01:48:03,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:48:03,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-03-04 01:48:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:03,647 INFO L225 Difference]: With dead ends: 200 [2025-03-04 01:48:03,647 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 01:48:03,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-04 01:48:03,651 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:03,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:48:03,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 01:48:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-04 01:48:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.430232558139535) internal successors, (123), 86 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:48:03,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 147 transitions. [2025-03-04 01:48:03,688 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 147 transitions. Word has length 100 [2025-03-04 01:48:03,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:03,688 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 147 transitions. [2025-03-04 01:48:03,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:48:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 147 transitions. [2025-03-04 01:48:03,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:48:03,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:03,692 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:03,699 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-04 01:48:03,892 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-04 01:48:03,893 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:03,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:03,894 INFO L85 PathProgramCache]: Analyzing trace with hash -580349901, now seen corresponding path program 1 times [2025-03-04 01:48:03,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:03,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133642168] [2025-03-04 01:48:03,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:03,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:03,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:48:03,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:48:03,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:03,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:04,271 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 01:48:04,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133642168] [2025-03-04 01:48:04,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133642168] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:48:04,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755334065] [2025-03-04 01:48:04,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:04,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:48:04,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:48:04,276 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-04 01:48:04,277 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-04 01:48:04,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:48:04,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:48:04,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:04,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:04,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:48:04,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:04,509 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:04,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755334065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:04,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:48:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:48:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826159219] [2025-03-04 01:48:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:04,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:48:04,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:04,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:48:04,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:48:04,512 INFO L87 Difference]: Start difference. First operand 100 states and 147 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:04,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:04,557 INFO L93 Difference]: Finished difference Result 199 states and 294 transitions. [2025-03-04 01:48:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:48:04,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2025-03-04 01:48:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:04,560 INFO L225 Difference]: With dead ends: 199 [2025-03-04 01:48:04,561 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 01:48:04,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 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-04 01:48:04,563 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:04,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:48:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 01:48:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-04 01:48:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 88 states have internal predecessors, (125), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:48:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2025-03-04 01:48:04,575 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 100 [2025-03-04 01:48:04,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:04,577 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2025-03-04 01:48:04,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2025-03-04 01:48:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:48:04,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:04,579 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:04,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:48:04,779 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-04 01:48:04,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:04,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:04,781 INFO L85 PathProgramCache]: Analyzing trace with hash 925348375, now seen corresponding path program 1 times [2025-03-04 01:48:04,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:04,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772376037] [2025-03-04 01:48:04,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:04,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:04,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:48:04,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:48:04,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:04,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:04,940 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:04,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:04,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772376037] [2025-03-04 01:48:04,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772376037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:04,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:04,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:48:04,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091209221] [2025-03-04 01:48:04,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:04,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:48:04,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:04,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:48:04,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:48:04,943 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:05,006 INFO L93 Difference]: Finished difference Result 245 states and 361 transitions. [2025-03-04 01:48:05,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:48:05,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-04 01:48:05,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:05,011 INFO L225 Difference]: With dead ends: 245 [2025-03-04 01:48:05,011 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 01:48:05,011 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-04 01:48:05,011 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 60 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:05,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 284 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:48:05,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 01:48:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2025-03-04 01:48:05,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:48:05,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2025-03-04 01:48:05,027 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 103 [2025-03-04 01:48:05,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:05,027 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2025-03-04 01:48:05,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:05,028 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2025-03-04 01:48:05,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:48:05,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:05,029 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:05,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:48:05,030 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:05,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:05,032 INFO L85 PathProgramCache]: Analyzing trace with hash 399755262, now seen corresponding path program 1 times [2025-03-04 01:48:05,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:05,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510105930] [2025-03-04 01:48:05,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:05,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:05,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:48:05,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:48:05,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:05,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:07,120 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:07,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:07,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510105930] [2025-03-04 01:48:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510105930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:07,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:48:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698404397] [2025-03-04 01:48:07,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:07,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:48:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:07,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:48:07,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:48:07,123 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:48:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:07,908 INFO L93 Difference]: Finished difference Result 289 states and 426 transitions. [2025-03-04 01:48:07,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:48:07,909 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2025-03-04 01:48:07,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:07,912 INFO L225 Difference]: With dead ends: 289 [2025-03-04 01:48:07,912 INFO L226 Difference]: Without dead ends: 173 [2025-03-04 01:48:07,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:48:07,913 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 448 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:07,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 588 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:48:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-04 01:48:07,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 147. [2025-03-04 01:48:07,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 133 states have (on average 1.4511278195488722) internal successors, (193), 133 states have internal predecessors, (193), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:48:07,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 217 transitions. [2025-03-04 01:48:07,934 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 217 transitions. Word has length 103 [2025-03-04 01:48:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:07,937 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 217 transitions. [2025-03-04 01:48:07,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 13 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:48:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 217 transitions. [2025-03-04 01:48:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 01:48:07,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:07,938 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:48:07,939 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:07,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1286722261, now seen corresponding path program 1 times [2025-03-04 01:48:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:07,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125935517] [2025-03-04 01:48:07,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:07,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:07,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:48:08,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:48:08,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:08,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:48:08,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1215540477] [2025-03-04 01:48:08,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:08,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:48:08,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:48:08,082 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-04 01:48:08,084 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-04 01:48:08,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 01:48:08,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 01:48:08,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:08,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:08,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:48:08,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:08,289 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 61 treesize of output 60 [2025-03-04 01:48:08,377 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 86 treesize of output 74 [2025-03-04 01:48:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:08,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:08,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:08,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125935517] [2025-03-04 01:48:08,487 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 01:48:08,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215540477] [2025-03-04 01:48:08,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215540477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:08,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:08,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:48:08,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404820372] [2025-03-04 01:48:08,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:08,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:48:08,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:08,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:48:08,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:48:08,488 INFO L87 Difference]: Start difference. First operand 147 states and 217 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:09,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:09,285 INFO L93 Difference]: Finished difference Result 408 states and 605 transitions. [2025-03-04 01:48:09,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:48:09,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-04 01:48:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:09,288 INFO L225 Difference]: With dead ends: 408 [2025-03-04 01:48:09,288 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 01:48:09,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:48:09,289 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 97 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:09,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 357 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:48:09,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 01:48:09,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 218. [2025-03-04 01:48:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 191 states have (on average 1.4293193717277486) internal successors, (273), 191 states have internal predecessors, (273), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:09,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 321 transitions. [2025-03-04 01:48:09,316 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 321 transitions. Word has length 105 [2025-03-04 01:48:09,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:09,317 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 321 transitions. [2025-03-04 01:48:09,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:09,317 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 321 transitions. [2025-03-04 01:48:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:48:09,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:09,318 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:09,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:48:09,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:48:09,519 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:09,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 400744610, now seen corresponding path program 1 times [2025-03-04 01:48:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832349838] [2025-03-04 01:48:09,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:09,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:48:09,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:48:09,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:09,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:10,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:10,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832349838] [2025-03-04 01:48:10,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832349838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:10,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:10,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:48:10,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322154662] [2025-03-04 01:48:10,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:10,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:48:10,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:10,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:48:10,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:48:10,864 INFO L87 Difference]: Start difference. First operand 218 states and 321 transitions. Second operand has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:11,444 INFO L93 Difference]: Finished difference Result 425 states and 621 transitions. [2025-03-04 01:48:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:48:11,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2025-03-04 01:48:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:11,449 INFO L225 Difference]: With dead ends: 425 [2025-03-04 01:48:11,449 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 01:48:11,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:48:11,451 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 362 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:11,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 373 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:48:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 01:48:11,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 228. [2025-03-04 01:48:11,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 201 states have (on average 1.4179104477611941) internal successors, (285), 201 states have internal predecessors, (285), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:11,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 333 transitions. [2025-03-04 01:48:11,473 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 333 transitions. Word has length 106 [2025-03-04 01:48:11,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:11,473 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 333 transitions. [2025-03-04 01:48:11,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.444444444444445) internal successors, (49), 11 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:11,473 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 333 transitions. [2025-03-04 01:48:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:48:11,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:11,474 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:11,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:48:11,475 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:11,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:11,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1396206749, now seen corresponding path program 1 times [2025-03-04 01:48:11,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:11,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205692266] [2025-03-04 01:48:11,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:11,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:48:11,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:48:11,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:11,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:12,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:12,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205692266] [2025-03-04 01:48:12,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205692266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:12,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:12,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:48:12,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618258150] [2025-03-04 01:48:12,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:12,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:48:12,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:12,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:48:12,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:48:12,967 INFO L87 Difference]: Start difference. First operand 228 states and 333 transitions. Second operand has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-04 01:48:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:13,657 INFO L93 Difference]: Finished difference Result 434 states and 640 transitions. [2025-03-04 01:48:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:48:13,659 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) Word has length 106 [2025-03-04 01:48:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:13,660 INFO L225 Difference]: With dead ends: 434 [2025-03-04 01:48:13,660 INFO L226 Difference]: Without dead ends: 280 [2025-03-04 01:48:13,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:48:13,661 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 276 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:13,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 500 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:48:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-03-04 01:48:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 268. [2025-03-04 01:48:13,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 240 states have (on average 1.425) internal successors, (342), 240 states have internal predecessors, (342), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 390 transitions. [2025-03-04 01:48:13,683 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 390 transitions. Word has length 106 [2025-03-04 01:48:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:13,683 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 390 transitions. [2025-03-04 01:48:13,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.444444444444445) internal successors, (49), 12 states have internal predecessors, (49), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-04 01:48:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 390 transitions. [2025-03-04 01:48:13,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:48:13,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:13,684 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:13,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:48:13,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:13,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1184855836, now seen corresponding path program 1 times [2025-03-04 01:48:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:13,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976344096] [2025-03-04 01:48:13,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:13,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:48:13,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:48:13,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:13,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:15,649 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:15,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:15,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976344096] [2025-03-04 01:48:15,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976344096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:15,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:15,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-04 01:48:15,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641222217] [2025-03-04 01:48:15,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:15,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 01:48:15,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:15,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 01:48:15,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:48:15,652 INFO L87 Difference]: Start difference. First operand 268 states and 390 transitions. Second operand has 17 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:17,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:17,084 INFO L93 Difference]: Finished difference Result 555 states and 813 transitions. [2025-03-04 01:48:17,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:48:17,084 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 106 [2025-03-04 01:48:17,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:17,086 INFO L225 Difference]: With dead ends: 555 [2025-03-04 01:48:17,086 INFO L226 Difference]: Without dead ends: 387 [2025-03-04 01:48:17,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-03-04 01:48:17,087 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 294 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:17,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 1007 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:48:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-04 01:48:17,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 334. [2025-03-04 01:48:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 306 states have (on average 1.4444444444444444) internal successors, (442), 306 states have internal predecessors, (442), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 490 transitions. [2025-03-04 01:48:17,106 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 490 transitions. Word has length 106 [2025-03-04 01:48:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:17,106 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 490 transitions. [2025-03-04 01:48:17,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 17 states have internal predecessors, (49), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 490 transitions. [2025-03-04 01:48:17,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:48:17,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:17,107 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:17,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:48:17,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:17,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:17,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1197273984, now seen corresponding path program 1 times [2025-03-04 01:48:17,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:17,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940776763] [2025-03-04 01:48:17,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:17,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:17,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:48:17,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:48:17,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:17,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:18,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:18,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940776763] [2025-03-04 01:48:18,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940776763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:18,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:18,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:48:18,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270237081] [2025-03-04 01:48:18,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:18,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:48:18,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:18,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:48:18,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:48:18,376 INFO L87 Difference]: Start difference. First operand 334 states and 490 transitions. Second operand has 12 states, 10 states have (on average 5.0) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:19,072 INFO L93 Difference]: Finished difference Result 592 states and 869 transitions. [2025-03-04 01:48:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:48:19,073 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.0) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2025-03-04 01:48:19,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:19,074 INFO L225 Difference]: With dead ends: 592 [2025-03-04 01:48:19,075 INFO L226 Difference]: Without dead ends: 387 [2025-03-04 01:48:19,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:48:19,075 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 317 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:19,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 476 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:48:19,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-04 01:48:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 334. [2025-03-04 01:48:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 306 states have (on average 1.4444444444444444) internal successors, (442), 306 states have internal predecessors, (442), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 490 transitions. [2025-03-04 01:48:19,094 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 490 transitions. Word has length 107 [2025-03-04 01:48:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:19,094 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 490 transitions. [2025-03-04 01:48:19,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.0) internal successors, (50), 12 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 490 transitions. [2025-03-04 01:48:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 01:48:19,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:19,095 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:19,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:48:19,095 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:19,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:19,095 INFO L85 PathProgramCache]: Analyzing trace with hash -599677375, now seen corresponding path program 1 times [2025-03-04 01:48:19,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:19,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087075013] [2025-03-04 01:48:19,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:19,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:19,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 01:48:19,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 01:48:19,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:19,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:20,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:20,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087075013] [2025-03-04 01:48:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087075013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:20,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:20,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:48:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432787558] [2025-03-04 01:48:20,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:20,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:48:20,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:20,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:48:20,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:48:20,474 INFO L87 Difference]: Start difference. First operand 334 states and 490 transitions. Second operand has 13 states, 10 states have (on average 5.0) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-04 01:48:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:21,223 INFO L93 Difference]: Finished difference Result 547 states and 809 transitions. [2025-03-04 01:48:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:48:21,224 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 5.0) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) Word has length 107 [2025-03-04 01:48:21,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:21,226 INFO L225 Difference]: With dead ends: 547 [2025-03-04 01:48:21,226 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 01:48:21,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:48:21,228 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 207 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:21,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 496 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:48:21,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 01:48:21,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 336. [2025-03-04 01:48:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 308 states have (on average 1.4415584415584415) internal successors, (444), 308 states have internal predecessors, (444), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 492 transitions. [2025-03-04 01:48:21,248 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 492 transitions. Word has length 107 [2025-03-04 01:48:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:21,249 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 492 transitions. [2025-03-04 01:48:21,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 5.0) internal successors, (50), 13 states have internal predecessors, (50), 5 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-04 01:48:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 492 transitions. [2025-03-04 01:48:21,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:48:21,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:21,250 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:21,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:48:21,250 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:21,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:21,250 INFO L85 PathProgramCache]: Analyzing trace with hash -244851615, now seen corresponding path program 1 times [2025-03-04 01:48:21,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:21,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356125825] [2025-03-04 01:48:21,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:21,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:21,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:48:21,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:48:21,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:21,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:23,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:23,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356125825] [2025-03-04 01:48:23,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356125825] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:23,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:23,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:48:23,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563291878] [2025-03-04 01:48:23,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:23,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:48:23,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:23,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:48:23,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:48:23,592 INFO L87 Difference]: Start difference. First operand 336 states and 492 transitions. Second operand has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:24,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:24,654 INFO L93 Difference]: Finished difference Result 649 states and 956 transitions. [2025-03-04 01:48:24,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:48:24,655 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2025-03-04 01:48:24,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:24,658 INFO L225 Difference]: With dead ends: 649 [2025-03-04 01:48:24,658 INFO L226 Difference]: Without dead ends: 443 [2025-03-04 01:48:24,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:48:24,659 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 404 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:24,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 527 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:48:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-04 01:48:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 394. [2025-03-04 01:48:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 366 states have (on average 1.4480874316939891) internal successors, (530), 366 states have internal predecessors, (530), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 578 transitions. [2025-03-04 01:48:24,682 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 578 transitions. Word has length 108 [2025-03-04 01:48:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:24,685 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 578 transitions. [2025-03-04 01:48:24,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 578 transitions. [2025-03-04 01:48:24,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:48:24,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:24,686 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:24,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:48:24,687 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:24,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:24,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2041802974, now seen corresponding path program 1 times [2025-03-04 01:48:24,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:24,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904338341] [2025-03-04 01:48:24,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:24,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:24,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:48:24,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:48:24,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:24,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:26,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:26,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904338341] [2025-03-04 01:48:26,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904338341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:26,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:26,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:48:26,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560615908] [2025-03-04 01:48:26,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:26,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:48:26,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:26,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:48:26,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:48:26,276 INFO L87 Difference]: Start difference. First operand 394 states and 578 transitions. Second operand has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:27,254 INFO L93 Difference]: Finished difference Result 680 states and 1001 transitions. [2025-03-04 01:48:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:48:27,255 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2025-03-04 01:48:27,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:27,257 INFO L225 Difference]: With dead ends: 680 [2025-03-04 01:48:27,257 INFO L226 Difference]: Without dead ends: 441 [2025-03-04 01:48:27,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-03-04 01:48:27,258 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 217 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:27,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 736 Invalid, 1090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:48:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2025-03-04 01:48:27,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 394. [2025-03-04 01:48:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 366 states have (on average 1.4426229508196722) internal successors, (528), 366 states have internal predecessors, (528), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:27,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 576 transitions. [2025-03-04 01:48:27,281 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 576 transitions. Word has length 108 [2025-03-04 01:48:27,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:27,281 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 576 transitions. [2025-03-04 01:48:27,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.923076923076923) internal successors, (51), 15 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 576 transitions. [2025-03-04 01:48:27,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:48:27,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:27,284 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:27,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:48:27,285 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:27,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:27,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1003587007, now seen corresponding path program 1 times [2025-03-04 01:48:27,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288047981] [2025-03-04 01:48:27,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:27,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:27,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:48:27,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:48:27,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:27,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:27,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:27,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288047981] [2025-03-04 01:48:27,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288047981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:27,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:27,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:48:27,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695686049] [2025-03-04 01:48:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:27,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:48:27,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:27,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:48:27,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:48:27,453 INFO L87 Difference]: Start difference. First operand 394 states and 576 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:27,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:27,617 INFO L93 Difference]: Finished difference Result 663 states and 976 transitions. [2025-03-04 01:48:27,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:48:27,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-03-04 01:48:27,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:27,619 INFO L225 Difference]: With dead ends: 663 [2025-03-04 01:48:27,619 INFO L226 Difference]: Without dead ends: 394 [2025-03-04 01:48:27,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:48:27,620 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 4 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:27,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 455 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:48:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-04 01:48:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2025-03-04 01:48:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 366 states have (on average 1.4371584699453552) internal successors, (526), 366 states have internal predecessors, (526), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 574 transitions. [2025-03-04 01:48:27,639 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 574 transitions. Word has length 108 [2025-03-04 01:48:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:27,639 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 574 transitions. [2025-03-04 01:48:27,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 574 transitions. [2025-03-04 01:48:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:48:27,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:27,640 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:27,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:48:27,640 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:27,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:27,641 INFO L85 PathProgramCache]: Analyzing trace with hash -792236094, now seen corresponding path program 1 times [2025-03-04 01:48:27,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:27,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094129694] [2025-03-04 01:48:27,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:27,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:27,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:48:27,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:48:27,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:27,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:29,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094129694] [2025-03-04 01:48:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094129694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:48:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043266203] [2025-03-04 01:48:29,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:29,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:48:29,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:29,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:48:29,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:48:29,292 INFO L87 Difference]: Start difference. First operand 394 states and 574 transitions. Second operand has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:30,256 INFO L93 Difference]: Finished difference Result 704 states and 1032 transitions. [2025-03-04 01:48:30,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:48:30,256 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 108 [2025-03-04 01:48:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:30,258 INFO L225 Difference]: With dead ends: 704 [2025-03-04 01:48:30,258 INFO L226 Difference]: Without dead ends: 465 [2025-03-04 01:48:30,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:48:30,259 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 429 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:30,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 772 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:48:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-04 01:48:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 416. [2025-03-04 01:48:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 388 states have (on average 1.4381443298969072) internal successors, (558), 388 states have internal predecessors, (558), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 606 transitions. [2025-03-04 01:48:30,280 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 606 transitions. Word has length 108 [2025-03-04 01:48:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:30,280 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 606 transitions. [2025-03-04 01:48:30,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:30,281 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 606 transitions. [2025-03-04 01:48:30,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:48:30,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:30,281 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:30,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:48:30,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:30,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:30,282 INFO L85 PathProgramCache]: Analyzing trace with hash 87561410, now seen corresponding path program 1 times [2025-03-04 01:48:30,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:30,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021466900] [2025-03-04 01:48:30,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:30,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:30,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:48:30,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:48:30,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:30,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:31,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:31,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021466900] [2025-03-04 01:48:31,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021466900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:48:31,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108084024] [2025-03-04 01:48:31,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:31,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:48:31,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:31,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:48:31,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:48:31,452 INFO L87 Difference]: Start difference. First operand 416 states and 606 transitions. Second operand has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:48:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:32,353 INFO L93 Difference]: Finished difference Result 723 states and 1058 transitions. [2025-03-04 01:48:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:48:32,354 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-03-04 01:48:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:32,356 INFO L225 Difference]: With dead ends: 723 [2025-03-04 01:48:32,356 INFO L226 Difference]: Without dead ends: 471 [2025-03-04 01:48:32,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:48:32,357 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 475 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:32,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 686 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 01:48:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-04 01:48:32,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 416. [2025-03-04 01:48:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 388 states have (on average 1.4381443298969072) internal successors, (558), 388 states have internal predecessors, (558), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 606 transitions. [2025-03-04 01:48:32,380 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 606 transitions. Word has length 109 [2025-03-04 01:48:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:32,381 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 606 transitions. [2025-03-04 01:48:32,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.0) internal successors, (52), 14 states have internal predecessors, (52), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:48:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 606 transitions. [2025-03-04 01:48:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:48:32,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:32,382 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:32,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:48:32,382 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:32,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:32,382 INFO L85 PathProgramCache]: Analyzing trace with hash -894401601, now seen corresponding path program 1 times [2025-03-04 01:48:32,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:32,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827261718] [2025-03-04 01:48:32,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:32,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:32,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:48:32,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:48:32,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:32,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:32,596 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:32,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:32,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827261718] [2025-03-04 01:48:32,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827261718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:32,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:32,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:48:32,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169428689] [2025-03-04 01:48:32,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:32,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:48:32,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:32,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:48:32,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:48:32,598 INFO L87 Difference]: Start difference. First operand 416 states and 606 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:32,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:32,814 INFO L93 Difference]: Finished difference Result 719 states and 1052 transitions. [2025-03-04 01:48:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:48:32,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2025-03-04 01:48:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:32,816 INFO L225 Difference]: With dead ends: 719 [2025-03-04 01:48:32,816 INFO L226 Difference]: Without dead ends: 467 [2025-03-04 01:48:32,817 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:48:32,817 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 46 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:32,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 421 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:48:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-04 01:48:32,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 418. [2025-03-04 01:48:32,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 390 states have (on average 1.441025641025641) internal successors, (562), 390 states have internal predecessors, (562), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:32,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 610 transitions. [2025-03-04 01:48:32,836 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 610 transitions. Word has length 110 [2025-03-04 01:48:32,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:32,836 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 610 transitions. [2025-03-04 01:48:32,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:32,836 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 610 transitions. [2025-03-04 01:48:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:48:32,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:32,837 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:32,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:48:32,837 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:32,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:32,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1603614336, now seen corresponding path program 1 times [2025-03-04 01:48:32,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:32,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766555824] [2025-03-04 01:48:32,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:32,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:32,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:48:32,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:48:32,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:32,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:33,786 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:33,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:33,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766555824] [2025-03-04 01:48:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766555824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:33,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:33,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:48:33,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330123483] [2025-03-04 01:48:33,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:33,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:48:33,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:33,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:48:33,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:48:33,788 INFO L87 Difference]: Start difference. First operand 418 states and 610 transitions. Second operand has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:48:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:35,059 INFO L93 Difference]: Finished difference Result 791 states and 1156 transitions. [2025-03-04 01:48:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 01:48:35,060 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-03-04 01:48:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:35,061 INFO L225 Difference]: With dead ends: 791 [2025-03-04 01:48:35,061 INFO L226 Difference]: Without dead ends: 537 [2025-03-04 01:48:35,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2025-03-04 01:48:35,062 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 269 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:35,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 1265 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1713 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:48:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-03-04 01:48:35,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 482. [2025-03-04 01:48:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 454 states have (on average 1.4449339207048457) internal successors, (656), 454 states have internal predecessors, (656), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 704 transitions. [2025-03-04 01:48:35,083 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 704 transitions. Word has length 110 [2025-03-04 01:48:35,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:35,083 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 704 transitions. [2025-03-04 01:48:35,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.1176470588235294) internal successors, (53), 18 states have internal predecessors, (53), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 01:48:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 704 transitions. [2025-03-04 01:48:35,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:48:35,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:35,084 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:35,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:48:35,084 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:35,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:35,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1517557569, now seen corresponding path program 1 times [2025-03-04 01:48:35,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:35,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342569380] [2025-03-04 01:48:35,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:35,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:35,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:48:35,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:48:35,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:35,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:39,281 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:39,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:39,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342569380] [2025-03-04 01:48:39,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342569380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:39,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:39,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 01:48:39,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180391208] [2025-03-04 01:48:39,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:39,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 01:48:39,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:39,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 01:48:39,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:48:39,283 INFO L87 Difference]: Start difference. First operand 482 states and 704 transitions. Second operand has 19 states, 14 states have (on average 3.857142857142857) internal successors, (54), 19 states have internal predecessors, (54), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 01:48:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:40,738 INFO L93 Difference]: Finished difference Result 825 states and 1210 transitions. [2025-03-04 01:48:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:48:40,739 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 3.857142857142857) internal successors, (54), 19 states have internal predecessors, (54), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 8 states have call successors, (12) Word has length 111 [2025-03-04 01:48:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:40,740 INFO L225 Difference]: With dead ends: 825 [2025-03-04 01:48:40,740 INFO L226 Difference]: Without dead ends: 533 [2025-03-04 01:48:40,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:48:40,741 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 295 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1424 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:40,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 917 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1424 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 01:48:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-03-04 01:48:40,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 482. [2025-03-04 01:48:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 454 states have (on average 1.4449339207048457) internal successors, (656), 454 states have internal predecessors, (656), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 704 transitions. [2025-03-04 01:48:40,761 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 704 transitions. Word has length 111 [2025-03-04 01:48:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:40,761 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 704 transitions. [2025-03-04 01:48:40,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 3.857142857142857) internal successors, (54), 19 states have internal predecessors, (54), 8 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 01:48:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 704 transitions. [2025-03-04 01:48:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:48:40,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:40,762 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:40,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:48:40,762 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:40,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:40,763 INFO L85 PathProgramCache]: Analyzing trace with hash 687055361, now seen corresponding path program 1 times [2025-03-04 01:48:40,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:40,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768116085] [2025-03-04 01:48:40,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:40,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:40,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:48:40,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:48:40,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:40,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:43,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:43,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768116085] [2025-03-04 01:48:43,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768116085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:43,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:43,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-04 01:48:43,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805936573] [2025-03-04 01:48:43,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:43,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 01:48:43,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:43,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 01:48:43,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:48:43,338 INFO L87 Difference]: Start difference. First operand 482 states and 704 transitions. Second operand has 15 states, 11 states have (on average 4.909090909090909) internal successors, (54), 15 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 01:48:44,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:44,377 INFO L93 Difference]: Finished difference Result 831 states and 1215 transitions. [2025-03-04 01:48:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:48:44,377 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 4.909090909090909) internal successors, (54), 15 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) Word has length 111 [2025-03-04 01:48:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:44,379 INFO L225 Difference]: With dead ends: 831 [2025-03-04 01:48:44,379 INFO L226 Difference]: Without dead ends: 539 [2025-03-04 01:48:44,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:48:44,380 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 233 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:44,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 704 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:48:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-04 01:48:44,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 536. [2025-03-04 01:48:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 505 states have (on average 1.4198019801980197) internal successors, (717), 506 states have internal predecessors, (717), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:48:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 769 transitions. [2025-03-04 01:48:44,402 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 769 transitions. Word has length 111 [2025-03-04 01:48:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:44,402 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 769 transitions. [2025-03-04 01:48:44,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 4.909090909090909) internal successors, (54), 15 states have internal predecessors, (54), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 01:48:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 769 transitions. [2025-03-04 01:48:44,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:48:44,403 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:44,403 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:44,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:48:44,404 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:44,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1395328517, now seen corresponding path program 1 times [2025-03-04 01:48:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:44,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239051439] [2025-03-04 01:48:44,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:44,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:48:44,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:48:44,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:44,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:46,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239051439] [2025-03-04 01:48:46,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239051439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:46,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:46,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-03-04 01:48:46,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271482292] [2025-03-04 01:48:46,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:46,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:48:46,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:46,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:48:46,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:48:46,636 INFO L87 Difference]: Start difference. First operand 536 states and 769 transitions. Second operand has 16 states, 14 states have (on average 3.857142857142857) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:47,826 INFO L93 Difference]: Finished difference Result 921 states and 1324 transitions. [2025-03-04 01:48:47,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:48:47,827 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.857142857142857) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 111 [2025-03-04 01:48:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:47,830 INFO L225 Difference]: With dead ends: 921 [2025-03-04 01:48:47,830 INFO L226 Difference]: Without dead ends: 575 [2025-03-04 01:48:47,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:48:47,832 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 422 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:47,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 746 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:48:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-03-04 01:48:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 536. [2025-03-04 01:48:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 505 states have (on average 1.4118811881188118) internal successors, (713), 506 states have internal predecessors, (713), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:48:47,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 765 transitions. [2025-03-04 01:48:47,861 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 765 transitions. Word has length 111 [2025-03-04 01:48:47,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:47,861 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 765 transitions. [2025-03-04 01:48:47,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.857142857142857) internal successors, (54), 16 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 765 transitions. [2025-03-04 01:48:47,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:48:47,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:47,862 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:47,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:48:47,862 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:47,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1486537762, now seen corresponding path program 1 times [2025-03-04 01:48:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:47,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134704357] [2025-03-04 01:48:47,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:47,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:48:47,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:48:47,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:47,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:49,789 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:49,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:48:49,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134704357] [2025-03-04 01:48:49,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134704357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:49,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:49,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:48:49,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303642878] [2025-03-04 01:48:49,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:49,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:48:49,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:48:49,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:48:49,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:48:49,790 INFO L87 Difference]: Start difference. First operand 536 states and 765 transitions. Second operand has 14 states, 12 states have (on average 4.5) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:50,647 INFO L93 Difference]: Finished difference Result 903 states and 1288 transitions. [2025-03-04 01:48:50,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:48:50,648 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) Word has length 111 [2025-03-04 01:48:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:50,649 INFO L225 Difference]: With dead ends: 903 [2025-03-04 01:48:50,653 INFO L226 Difference]: Without dead ends: 557 [2025-03-04 01:48:50,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:48:50,655 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 529 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:50,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 450 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:48:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-03-04 01:48:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 500. [2025-03-04 01:48:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 469 states have (on average 1.4051172707889126) internal successors, (659), 470 states have internal predecessors, (659), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:48:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 711 transitions. [2025-03-04 01:48:50,678 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 711 transitions. Word has length 111 [2025-03-04 01:48:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:50,678 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 711 transitions. [2025-03-04 01:48:50,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 01:48:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 711 transitions. [2025-03-04 01:48:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-04 01:48:50,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:50,680 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:50,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:48:50,680 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:50,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:50,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1291935548, now seen corresponding path program 1 times [2025-03-04 01:48:50,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:48:50,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884969442] [2025-03-04 01:48:50,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:50,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:48:50,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:48:50,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:48:50,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:50,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:48:50,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [194790438] [2025-03-04 01:48:50,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:50,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:48:50,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:48:50,744 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-04 01:48:50,745 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-04 01:48:50,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:48:51,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:48:51,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:51,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:48:51,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:48:51,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-04 01:48:51,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-04 01:48:51,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:51,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:48:51,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:48:51,385 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:48:51,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:48:51,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:48:51,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:48:51,591 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:48:51,671 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:48:51,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:48:51 BoogieIcfgContainer [2025-03-04 01:48:51,673 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:48:51,674 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:48:51,674 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:48:51,674 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:48:51,675 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:48:03" (3/4) ... [2025-03-04 01:48:51,680 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:48:51,680 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:48:51,681 INFO L158 Benchmark]: Toolchain (without parser) took 49618.48ms. Allocated memory was 201.3MB in the beginning and 645.9MB in the end (delta: 444.6MB). Free memory was 153.2MB in the beginning and 561.6MB in the end (delta: -408.4MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2025-03-04 01:48:51,681 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:48:51,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.85ms. Allocated memory is still 201.3MB. Free memory was 152.8MB in the beginning and 137.4MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:48:51,681 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.06ms. Allocated memory is still 201.3MB. Free memory was 137.4MB in the beginning and 133.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:48:51,681 INFO L158 Benchmark]: Boogie Preprocessor took 56.13ms. Allocated memory is still 201.3MB. Free memory was 133.3MB in the beginning and 130.7MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:48:51,681 INFO L158 Benchmark]: IcfgBuilder took 598.78ms. Allocated memory is still 201.3MB. Free memory was 130.7MB in the beginning and 93.5MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:48:51,682 INFO L158 Benchmark]: TraceAbstraction took 48669.69ms. Allocated memory was 201.3MB in the beginning and 645.9MB in the end (delta: 444.6MB). Free memory was 92.7MB in the beginning and 561.8MB in the end (delta: -469.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:48:51,682 INFO L158 Benchmark]: Witness Printer took 6.29ms. Allocated memory is still 645.9MB. Free memory was 561.8MB in the beginning and 561.6MB in the end (delta: 207.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:48:51,682 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.28ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.85ms. Allocated memory is still 201.3MB. Free memory was 152.8MB in the beginning and 137.4MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.06ms. Allocated memory is still 201.3MB. Free memory was 137.4MB in the beginning and 133.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.13ms. Allocated memory is still 201.3MB. Free memory was 133.3MB in the beginning and 130.7MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 598.78ms. Allocated memory is still 201.3MB. Free memory was 130.7MB in the beginning and 93.5MB in the end (delta: 37.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 48669.69ms. Allocated memory was 201.3MB in the beginning and 645.9MB in the end (delta: 444.6MB). Free memory was 92.7MB in the beginning and 561.8MB in the end (delta: -469.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.29ms. Allocated memory is still 645.9MB. Free memory was 561.8MB in the beginning and 561.6MB in the end (delta: 207.6kB). 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 someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someUnaryDOUBLEoperation at line 43. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 10, 200, 56955, 32, 1, 8, 1, -0.6, 9.125, 50.5 }; [L47] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] unsigned short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L49] unsigned short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L50] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L51] unsigned short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L52] unsigned short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L53] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L54] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L55] float* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L56] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L57] unsigned short int last_1_WrapperStruct00_var_1_1 = 10; [L58] unsigned short int last_1_WrapperStruct00_var_1_9 = 8; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=0, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L110] EXPR WrapperStruct00.var_1_1 [L110] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L111] EXPR WrapperStruct00.var_1_9 [L111] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L95] WrapperStruct00.var_1_7 = __VERIFIER_nondet_ushort() [L96] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L98] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ushort() [L99] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L101] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L102] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L104] WrapperStruct00.var_1_12 = __VERIFIER_nondet_float() [L105] EXPR WrapperStruct00.var_1_12 [L105] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_12 [L105] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L106] WrapperStruct00.var_1_13 = __VERIFIER_nondet_float() [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L107] EXPR WrapperStruct00.var_1_13 [L107] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L107] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L122] RET updateVariables() [L123] CALL step() [L62] COND TRUE last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L63] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L63] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L63] (*(WrapperStruct00_var_1_1_Pointer)) = (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))) [L65] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L65] (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) [L65] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L65] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L65] (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L65] COND FALSE !((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) [L76] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L76] (*(WrapperStruct00_var_1_9_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L78] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L85] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_12_Pointer)) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1 [L114] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L114] EXPR ((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) [L114] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L114] EXPR (((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer))))) [L114] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L114] EXPR (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L114] EXPR (*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) [L114] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L114] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) [L114] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) [L114] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L114] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L114] EXPR ((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114] EXPR (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L114-L115] return (((last_1_WrapperStruct00_var_1_9 <= (last_1_WrapperStruct00_var_1_9 * last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (((((*(WrapperStruct00_var_1_5_Pointer))) > (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer))))))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : (((((((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) - (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)))))))))) : 1) && (((*(WrapperStruct00_var_1_10_Pointer)) || ((*(WrapperStruct00_var_1_6_Pointer)) == (*(WrapperStruct00_var_1_8_Pointer)))) ? (((*(WrapperStruct00_var_1_6_Pointer)) <= (((((0) < ((*(WrapperStruct00_var_1_1_Pointer)))) ? (0) : ((*(WrapperStruct00_var_1_1_Pointer))))) << (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_6_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) && (((*(WrapperStruct00_var_1_7_Pointer)) != (*(WrapperStruct00_var_1_6_Pointer))) ? (((*(WrapperStruct00_var_1_7_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_12_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((float) (*(WrapperStruct00_var_1_12_Pointer))))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:13}, WrapperStruct00_var_1_12_Pointer={4:17}, WrapperStruct00_var_1_13_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:2}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:6}, WrapperStruct00_var_1_8_Pointer={4:8}, WrapperStruct00_var_1_9_Pointer={4:10}, isInitial=1, last_1_WrapperStruct00_var_1_1=10, last_1_WrapperStruct00_var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.5s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5418 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5384 mSDsluCounter, 12323 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10024 mSDsCounter, 339 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14913 IncrementalHoareTripleChecker+Invalid, 15252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 339 mSolverCounterUnsat, 2299 mSDtfsCounter, 14913 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 756 GetRequests, 465 SyntacticMatches, 1 SemanticMatches, 290 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=536occurred in iteration=19, InterpolantAutomatonStates: 187, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 21 MinimizatonAttempts, 728 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 28.3s InterpolantComputationTime, 2775 NumberOfCodeBlocks, 2775 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2425 ConstructedInterpolants, 0 QuantifiedInterpolants, 38773 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1224 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 23 InterpolantComputations, 21 PerfectInterpolantSequences, 6017/6072 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-04 01:48:51,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.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 c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:48:53,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:48:53,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:48:53,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:48:53,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:48:53,619 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:48:53,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:48:53,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:48:53,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:48:53,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:48:53,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:48:53,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:48:53,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:48:53,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:48:53,623 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:48:53,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:48:53,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:48:53,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:48:53,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:48:53,624 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:48:53,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:48:53,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:48:53,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:48:53,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:48:53,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:48:53,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:48:53,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:48:53,626 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:48:53,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:48:53,626 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:48:53,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:48:53,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:48:53,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:48:53,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:48:53,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:48:53,627 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 -> c554ccc5a601f8437729d4334efbdb5f23a6f490bc0338089a1c3e75130cdbec [2025-03-04 01:48:53,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:48:53,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:48:53,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:48:53,878 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:48:53,878 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:48:53,879 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-2.i [2025-03-04 01:48:55,056 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24303ab1/6f5dcc7b4e6c459f971fb90b7c108d74/FLAG9e71b526b [2025-03-04 01:48:55,230 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:48:55,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-2.i [2025-03-04 01:48:55,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24303ab1/6f5dcc7b4e6c459f971fb90b7c108d74/FLAG9e71b526b [2025-03-04 01:48:55,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b24303ab1/6f5dcc7b4e6c459f971fb90b7c108d74 [2025-03-04 01:48:55,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:48:55,257 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:48:55,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:48:55,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:48:55,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:48:55,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,265 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c45532 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55, skipping insertion in model container [2025-03-04 01:48:55,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:48:55,394 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-2.i[916,929] [2025-03-04 01:48:55,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:48:55,460 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:48:55,468 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-2.i[916,929] [2025-03-04 01:48:55,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:48:55,524 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:48:55,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55 WrapperNode [2025-03-04 01:48:55,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:48:55,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:48:55,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:48:55,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:48:55,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,576 INFO L138 Inliner]: procedures = 34, calls = 155, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 504 [2025-03-04 01:48:55,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:48:55,576 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:48:55,576 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:48:55,577 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:48:55,586 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,609 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 26 writes are split as follows [0, 26]. [2025-03-04 01:48:55,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,623 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:48:55,626 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:48:55,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:48:55,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:48:55,627 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (1/1) ... [2025-03-04 01:48:55,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:48:55,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:48:55,653 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-04 01:48:55,656 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-04 01:48:55,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:48:55,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:48:55,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:48:55,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:48:55,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:48:55,798 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:48:55,801 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:48:56,308 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite98#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite97#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite124#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite121#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite141#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite138#1;havoc property_#t~mem135#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-03-04 01:48:56,349 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2025-03-04 01:48:56,349 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:48:56,355 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:48:56,356 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:48:56,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:48:56 BoogieIcfgContainer [2025-03-04 01:48:56,356 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:48:56,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:48:56,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:48:56,361 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:48:56,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:48:55" (1/3) ... [2025-03-04 01:48:56,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff07032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:48:56, skipping insertion in model container [2025-03-04 01:48:56,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:48:55" (2/3) ... [2025-03-04 01:48:56,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff07032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:48:56, skipping insertion in model container [2025-03-04 01:48:56,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:48:56" (3/3) ... [2025-03-04 01:48:56,363 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-2.i [2025-03-04 01:48:56,373 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:48:56,374 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-2.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:48:56,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:48:56,422 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;@1e7def53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:48:56,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:48:56,425 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:48:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:48:56,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:56,433 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:56,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:56,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:56,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1380653923, now seen corresponding path program 1 times [2025-03-04 01:48:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:56,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642104860] [2025-03-04 01:48:56,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:56,445 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-04 01:48:56,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:56,447 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-04 01:48:56,449 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-04 01:48:56,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:48:56,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:48:56,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:56,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:56,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:48:56,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:56,712 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-04 01:48:56,712 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:56,713 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:56,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642104860] [2025-03-04 01:48:56,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642104860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:56,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:56,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:48:56,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882346563] [2025-03-04 01:48:56,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:56,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:48:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:56,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:48:56,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:48:56,736 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 85 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:48:56,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:56,753 INFO L93 Difference]: Finished difference Result 192 states and 299 transitions. [2025-03-04 01:48:56,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:48:56,754 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2025-03-04 01:48:56,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:56,760 INFO L225 Difference]: With dead ends: 192 [2025-03-04 01:48:56,760 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 01:48:56,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-04 01:48:56,764 INFO L435 NwaCegarLoop]: 141 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, 141 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-04 01:48:56,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:48:56,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 01:48:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 01:48:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:48:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 141 transitions. [2025-03-04 01:48:56,792 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 141 transitions. Word has length 100 [2025-03-04 01:48:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:56,792 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 141 transitions. [2025-03-04 01:48:56,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 01:48:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 141 transitions. [2025-03-04 01:48:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 01:48:56,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:56,795 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:56,802 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-04 01:48:57,000 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-04 01:48:57,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:57,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash -722048889, now seen corresponding path program 1 times [2025-03-04 01:48:57,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:57,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493185767] [2025-03-04 01:48:57,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:57,001 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-04 01:48:57,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:57,003 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-04 01:48:57,005 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-04 01:48:57,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 01:48:57,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 01:48:57,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:57,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:57,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:48:57,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:57,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:57,249 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493185767] [2025-03-04 01:48:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1493185767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:57,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:57,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:48:57,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095085670] [2025-03-04 01:48:57,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:57,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:48:57,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:57,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:48:57,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:48:57,251 INFO L87 Difference]: Start difference. First operand 96 states and 141 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:57,292 INFO L93 Difference]: Finished difference Result 191 states and 282 transitions. [2025-03-04 01:48:57,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:48:57,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 100 [2025-03-04 01:48:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:57,294 INFO L225 Difference]: With dead ends: 191 [2025-03-04 01:48:57,294 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:48:57,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 97 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-04 01:48:57,295 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 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-04 01:48:57,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:48:57,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:48:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:48:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 84 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:48:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 143 transitions. [2025-03-04 01:48:57,301 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 143 transitions. Word has length 100 [2025-03-04 01:48:57,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:57,302 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 143 transitions. [2025-03-04 01:48:57,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:57,302 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2025-03-04 01:48:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:48:57,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:57,304 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:57,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 01:48:57,505 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-04 01:48:57,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:57,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1767785405, now seen corresponding path program 1 times [2025-03-04 01:48:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:57,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [155513169] [2025-03-04 01:48:57,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:57,506 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-04 01:48:57,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:57,508 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-04 01:48:57,509 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-04 01:48:57,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:48:57,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:48:57,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:57,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:57,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 01:48:57,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:57,861 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:57,862 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:57,862 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:57,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [155513169] [2025-03-04 01:48:57,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [155513169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:57,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:57,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:48:57,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458803772] [2025-03-04 01:48:57,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:57,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:48:57,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:57,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:48:57,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:48:57,863 INFO L87 Difference]: Start difference. First operand 98 states and 143 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:57,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:57,970 INFO L93 Difference]: Finished difference Result 233 states and 343 transitions. [2025-03-04 01:48:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:48:57,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-04 01:48:57,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:57,974 INFO L225 Difference]: With dead ends: 233 [2025-03-04 01:48:57,974 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 01:48:57,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 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-04 01:48:57,975 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 54 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:57,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 276 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:48:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 01:48:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 113. [2025-03-04 01:48:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.4444444444444444) internal successors, (143), 99 states have internal predecessors, (143), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 01:48:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2025-03-04 01:48:57,986 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 103 [2025-03-04 01:48:57,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:57,987 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2025-03-04 01:48:57,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2025-03-04 01:48:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 01:48:57,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:57,991 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:57,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:48:58,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:48:58,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:48:58,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:48:58,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1256636206, now seen corresponding path program 1 times [2025-03-04 01:48:58,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:48:58,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606540952] [2025-03-04 01:48:58,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:48:58,193 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-04 01:48:58,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:48:58,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:48:58,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:48:58,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 01:48:58,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 01:48:58,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:48:58,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:48:58,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 01:48:58,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:48:58,467 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 60 treesize of output 59 [2025-03-04 01:48:58,550 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 92 [2025-03-04 01:48:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:48:58,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:48:58,900 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:48:58,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606540952] [2025-03-04 01:48:58,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606540952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:48:58,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:48:58,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:48:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531743379] [2025-03-04 01:48:58,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:48:58,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:48:58,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:48:58,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:48:58,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:48:58,901 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:48:59,779 INFO L93 Difference]: Finished difference Result 317 states and 470 transitions. [2025-03-04 01:48:59,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:48:59,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-03-04 01:48:59,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:48:59,784 INFO L225 Difference]: With dead ends: 317 [2025-03-04 01:48:59,785 INFO L226 Difference]: Without dead ends: 207 [2025-03-04 01:48:59,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:48:59,786 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 91 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:48:59,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 337 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:48:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-04 01:48:59,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 175. [2025-03-04 01:48:59,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 148 states have (on average 1.4189189189189189) internal successors, (210), 148 states have internal predecessors, (210), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 01:48:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 258 transitions. [2025-03-04 01:48:59,804 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 258 transitions. Word has length 103 [2025-03-04 01:48:59,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:48:59,804 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 258 transitions. [2025-03-04 01:48:59,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-04 01:48:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 258 transitions. [2025-03-04 01:48:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 01:48:59,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:48:59,805 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 01:48:59,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:49:00,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:49:00,006 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:49:00,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:49:00,007 INFO L85 PathProgramCache]: Analyzing trace with hash 862114298, now seen corresponding path program 1 times [2025-03-04 01:49:00,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:49:00,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272517158] [2025-03-04 01:49:00,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:00,007 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-04 01:49:00,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:49:00,010 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:49:00,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:49:00,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:49:00,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:49:00,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:00,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:00,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 01:49:00,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:00,721 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-04 01:49:01,210 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 22 treesize of output 21 [2025-03-04 01:49:01,941 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 39 treesize of output 37 [2025-03-04 01:49:02,460 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 47 treesize of output 48 [2025-03-04 01:49:03,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2025-03-04 01:49:03,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2025-03-04 01:49:04,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 66 [2025-03-04 01:49:04,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2025-03-04 01:49:04,325 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:49:04,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 75 treesize of output 43 [2025-03-04 01:49:04,389 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 161 proven. 80 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-04 01:49:04,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:49:09,361 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:49:09,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272517158] [2025-03-04 01:49:09,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272517158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:49:09,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1977439663] [2025-03-04 01:49:09,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:49:09,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:49:09,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:49:09,363 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:49:09,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-04 01:49:09,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 01:49:09,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 01:49:09,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:49:09,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:49:09,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 01:49:09,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:49:10,850 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-04 01:49:11,957 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-04 01:49:13,297 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 31 treesize of output 33 [2025-03-04 01:49:14,328 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 39 treesize of output 44 [2025-03-04 01:49:15,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2025-03-04 01:49:16,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47