./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.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 ee35e7bcfbc20dfdadfe45142e787a44862e2858c386c8809c339b2b306485b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:11:53,409 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:11:53,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 06:11:53,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:11:53,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:11:53,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:11:53,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:11:53,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:11:53,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:11:53,474 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:11:53,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:11:53,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:11:53,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:11:53,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:11:53,474 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:11:53,474 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:11:53,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:11:53,476 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:11:53,476 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:11:53,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:11:53,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:11:53,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:11:53,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:11:53,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:11:53,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:11:53,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:11:53,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:11:53,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 06:11:53,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 06:11:53,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:11:53,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:11:53,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:11:53,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:11:53,477 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 -> ee35e7bcfbc20dfdadfe45142e787a44862e2858c386c8809c339b2b306485b2 [2025-03-17 06:11:53,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:11:53,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:11:53,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:11:53,732 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:11:53,732 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:11:53,733 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-69.i [2025-03-17 06:11:54,885 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81e29c59/b79702a790df4a42a44a32d692a55819/FLAGbd2fe2306 [2025-03-17 06:11:55,141 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:11:55,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i [2025-03-17 06:11:55,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81e29c59/b79702a790df4a42a44a32d692a55819/FLAGbd2fe2306 [2025-03-17 06:11:55,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c81e29c59/b79702a790df4a42a44a32d692a55819 [2025-03-17 06:11:55,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:11:55,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:11:55,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:11:55,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:11:55,459 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:11:55,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,460 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@786c2644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55, skipping insertion in model container [2025-03-17 06:11:55,461 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:11:55,580 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-69.i[917,930] [2025-03-17 06:11:55,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:11:55,650 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:11:55,659 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-69.i[917,930] [2025-03-17 06:11:55,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:11:55,716 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:11:55,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55 WrapperNode [2025-03-17 06:11:55,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:11:55,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:11:55,719 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:11:55,719 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:11:55,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,731 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,758 INFO L138 Inliner]: procedures = 30, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 479 [2025-03-17 06:11:55,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:11:55,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:11:55,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:11:55,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:11:55,767 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,780 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-17 06:11:55,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,790 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:11:55,799 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:11:55,799 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:11:55,799 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:11:55,800 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (1/1) ... [2025-03-17 06:11:55,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:11:55,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:55,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:11:55,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:11:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:11:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-17 06:11:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-17 06:11:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-17 06:11:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 06:11:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-17 06:11:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 06:11:55,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:11:55,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:11:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 06:11:55,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:11:55,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:11:55,920 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:11:55,921 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:11:56,268 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~mem77#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~ite86#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem94#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite93#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short99#1;havoc property_#t~ite108#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~short115#1;havoc property_#t~ite130#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite124#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1; [2025-03-17 06:11:56,307 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-17 06:11:56,307 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:11:56,315 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:11:56,317 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:11:56,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:56 BoogieIcfgContainer [2025-03-17 06:11:56,317 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:11:56,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:11:56,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:11:56,323 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:11:56,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:11:55" (1/3) ... [2025-03-17 06:11:56,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409c0b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:11:56, skipping insertion in model container [2025-03-17 06:11:56,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:11:55" (2/3) ... [2025-03-17 06:11:56,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@409c0b58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:11:56, skipping insertion in model container [2025-03-17 06:11:56,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:56" (3/3) ... [2025-03-17 06:11:56,326 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-69.i [2025-03-17 06:11:56,335 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:11:56,336 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-69.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:11:56,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:11:56,386 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;@37fe75b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:11:56,387 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:11:56,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:56,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 06:11:56,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:56,400 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:56,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:56,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:56,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1904527961, now seen corresponding path program 1 times [2025-03-17 06:11:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:56,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047380679] [2025-03-17 06:11:56,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:56,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:56,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 06:11:56,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 06:11:56,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:56,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 06:11:56,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:56,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047380679] [2025-03-17 06:11:56,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047380679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:56,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663806492] [2025-03-17 06:11:56,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:56,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:56,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:56,711 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:56,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 06:11:56,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 06:11:56,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 06:11:56,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:56,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:56,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:11:56,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-17 06:11:56,907 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:56,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663806492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:56,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:56,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 06:11:56,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994932499] [2025-03-17 06:11:56,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:56,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:11:56,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:56,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:11:56,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:11:56,929 INFO L87 Difference]: Start difference. First operand has 88 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:11:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:56,944 INFO L93 Difference]: Finished difference Result 173 states and 277 transitions. [2025-03-17 06:11:56,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:11:56,946 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2025-03-17 06:11:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:56,950 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:11:56,950 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 06:11:56,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:11:56,954 INFO L435 NwaCegarLoop]: 128 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, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:11:56,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:56,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 06:11:56,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 06:11:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2025-03-17 06:11:56,980 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 128 transitions. Word has length 115 [2025-03-17 06:11:56,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:56,981 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 128 transitions. [2025-03-17 06:11:56,981 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:11:56,981 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 128 transitions. [2025-03-17 06:11:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 06:11:56,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:56,985 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:56,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:57,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 06:11:57,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:57,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash 326753364, now seen corresponding path program 1 times [2025-03-17 06:11:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:57,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060575702] [2025-03-17 06:11:57,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:57,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:57,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 06:11:57,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 06:11:57,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:57,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:57,591 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-17 06:11:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:11:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060575702] [2025-03-17 06:11:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060575702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 06:11:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960163329] [2025-03-17 06:11:57,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:57,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:57,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:57,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:57,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 06:11:57,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 06:11:57,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 06:11:57,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:57,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:57,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:11:57,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:11:57,814 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:11:57,814 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:11:57,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960163329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:11:57,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 06:11:57,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 06:11:57,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340498883] [2025-03-17 06:11:57,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:11:57,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:11:57,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:11:57,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:11:57,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 06:11:57,817 INFO L87 Difference]: Start difference. First operand 86 states and 128 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:11:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:11:57,853 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2025-03-17 06:11:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:11:57,854 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2025-03-17 06:11:57,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:11:57,856 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:11:57,857 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 06:11:57,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 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-17 06:11:57,858 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 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-17 06:11:57,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:11:57,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 06:11:57,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 06:11:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:11:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2025-03-17 06:11:57,873 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 115 [2025-03-17 06:11:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:11:57,875 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2025-03-17 06:11:57,875 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:11:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2025-03-17 06:11:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:11:57,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:11:57,876 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:11:57,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:11:58,081 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-17 06:11:58,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:11:58,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:11:58,083 INFO L85 PathProgramCache]: Analyzing trace with hash 2112440626, now seen corresponding path program 1 times [2025-03-17 06:11:58,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:11:58,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400116588] [2025-03-17 06:11:58,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:58,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:11:58,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:11:58,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:11:58,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:58,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:11:58,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676224880] [2025-03-17 06:11:58,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:11:58,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:11:58,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:11:58,289 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:11:58,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 06:11:58,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:11:58,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:11:58,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:11:58,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:11:58,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 06:11:58,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:00,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 06:12:00,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:12:00,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:12:00,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:12:00,478 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-17 06:12:00,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2025-03-17 06:12:00,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:12:00,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 43 [2025-03-17 06:12:00,788 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:00,788 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:00,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:00,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400116588] [2025-03-17 06:12:00,789 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 06:12:00,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676224880] [2025-03-17 06:12:00,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676224880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:00,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:00,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:12:00,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588520711] [2025-03-17 06:12:00,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:00,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:12:00,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:00,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:12:00,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:12:00,790 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:08,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 06:12:14,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 06:12:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:14,730 INFO L93 Difference]: Finished difference Result 217 states and 320 transitions. [2025-03-17 06:12:14,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:12:14,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2025-03-17 06:12:14,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:14,732 INFO L225 Difference]: With dead ends: 217 [2025-03-17 06:12:14,732 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 06:12:14,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:12:14,733 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 186 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 4 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:14,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 342 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 677 Invalid, 13 Unknown, 0 Unchecked, 12.4s Time] [2025-03-17 06:12:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 06:12:14,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2025-03-17 06:12:14,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:14,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2025-03-17 06:12:14,742 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 117 [2025-03-17 06:12:14,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:14,742 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2025-03-17 06:12:14,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2025-03-17 06:12:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:12:14,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:14,743 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:14,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 06:12:14,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:14,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1819037619, now seen corresponding path program 1 times [2025-03-17 06:12:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:14,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002074337] [2025-03-17 06:12:14,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:14,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:14,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:12:15,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:12:15,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:15,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:15,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:15,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002074337] [2025-03-17 06:12:15,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002074337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:15,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:15,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:12:15,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439266083] [2025-03-17 06:12:15,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:15,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:12:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:15,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:12:15,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:15,787 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:16,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:16,215 INFO L93 Difference]: Finished difference Result 222 states and 327 transitions. [2025-03-17 06:12:16,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:16,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2025-03-17 06:12:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:16,218 INFO L225 Difference]: With dead ends: 222 [2025-03-17 06:12:16,218 INFO L226 Difference]: Without dead ends: 125 [2025-03-17 06:12:16,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:16,221 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 213 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:16,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 238 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 06:12:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-17 06:12:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 98. [2025-03-17 06:12:16,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:16,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2025-03-17 06:12:16,236 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 117 [2025-03-17 06:12:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:16,237 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2025-03-17 06:12:16,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:16,237 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2025-03-17 06:12:16,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:12:16,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:16,240 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:16,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 06:12:16,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:16,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1267968755, now seen corresponding path program 1 times [2025-03-17 06:12:16,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:16,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641711139] [2025-03-17 06:12:16,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:16,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:12:16,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:12:16,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:16,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641711139] [2025-03-17 06:12:16,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641711139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:16,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:16,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:12:16,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540572132] [2025-03-17 06:12:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:16,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:12:16,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:16,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:12:16,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:16,826 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:17,384 INFO L93 Difference]: Finished difference Result 234 states and 344 transitions. [2025-03-17 06:12:17,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 06:12:17,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 117 [2025-03-17 06:12:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:17,388 INFO L225 Difference]: With dead ends: 234 [2025-03-17 06:12:17,388 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 06:12:17,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-17 06:12:17,389 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 171 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:17,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 269 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 06:12:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 06:12:17,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2025-03-17 06:12:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 87 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2025-03-17 06:12:17,407 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 117 [2025-03-17 06:12:17,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:17,408 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2025-03-17 06:12:17,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:17,408 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2025-03-17 06:12:17,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:12:17,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:17,410 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:17,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 06:12:17,410 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:17,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:17,410 INFO L85 PathProgramCache]: Analyzing trace with hash 974565748, now seen corresponding path program 1 times [2025-03-17 06:12:17,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:17,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594993327] [2025-03-17 06:12:17,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:17,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:12:17,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:12:17,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:17,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:12:17,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474313903] [2025-03-17 06:12:17,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:17,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:17,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:17,488 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:17,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 06:12:17,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:12:17,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:12:17,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:17,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:17,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 06:12:17,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:19,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 06:12:19,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:12:19,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:12:19,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 06:12:19,942 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-17 06:12:19,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 31 [2025-03-17 06:12:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:20,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:20,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594993327] [2025-03-17 06:12:20,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 06:12:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474313903] [2025-03-17 06:12:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474313903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:20,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:20,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 06:12:20,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455245346] [2025-03-17 06:12:20,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:20,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 06:12:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:20,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 06:12:20,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 06:12:20,240 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:26,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2025-03-17 06:12:30,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:30,827 INFO L93 Difference]: Finished difference Result 235 states and 344 transitions. [2025-03-17 06:12:30,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 06:12:30,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 117 [2025-03-17 06:12:30,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:30,830 INFO L225 Difference]: With dead ends: 235 [2025-03-17 06:12:30,830 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 06:12:30,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-03-17 06:12:30,831 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 191 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 4 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:30,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 407 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 871 Invalid, 40 Unknown, 0 Unchecked, 9.8s Time] [2025-03-17 06:12:30,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 06:12:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 104. [2025-03-17 06:12:30,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 87 states have internal predecessors, (123), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:30,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2025-03-17 06:12:30,859 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 117 [2025-03-17 06:12:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:30,860 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2025-03-17 06:12:30,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:30,860 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2025-03-17 06:12:30,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 06:12:30,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:30,861 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:30,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 06:12:31,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:31,063 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:31,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1076661489, now seen corresponding path program 1 times [2025-03-17 06:12:31,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:31,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935744376] [2025-03-17 06:12:31,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:31,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:31,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 06:12:31,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 06:12:31,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:31,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:31,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:31,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935744376] [2025-03-17 06:12:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935744376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:31,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:31,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 06:12:31,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324188474] [2025-03-17 06:12:31,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:31,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 06:12:31,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:31,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 06:12:31,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 06:12:31,599 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:32,004 INFO L93 Difference]: Finished difference Result 233 states and 341 transitions. [2025-03-17 06:12:32,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 06:12:32,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 118 [2025-03-17 06:12:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:32,005 INFO L225 Difference]: With dead ends: 233 [2025-03-17 06:12:32,005 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 06:12:32,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-17 06:12:32,006 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 132 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:32,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 507 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 06:12:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 102. [2025-03-17 06:12:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.411764705882353) internal successors, (120), 85 states have internal predecessors, (120), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2025-03-17 06:12:32,015 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 118 [2025-03-17 06:12:32,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:32,015 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2025-03-17 06:12:32,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:32,015 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2025-03-17 06:12:32,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-17 06:12:32,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:32,016 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:32,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 06:12:32,016 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:32,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash -534876059, now seen corresponding path program 1 times [2025-03-17 06:12:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:32,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2463276] [2025-03-17 06:12:32,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:32,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 06:12:32,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 06:12:32,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:32,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:32,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:32,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2463276] [2025-03-17 06:12:32,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2463276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:32,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:32,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:12:32,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360890671] [2025-03-17 06:12:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:32,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:12:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:32,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:12:32,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:12:32,479 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:32,868 INFO L93 Difference]: Finished difference Result 263 states and 386 transitions. [2025-03-17 06:12:32,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 06:12:32,869 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 118 [2025-03-17 06:12:32,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:32,870 INFO L225 Difference]: With dead ends: 263 [2025-03-17 06:12:32,870 INFO L226 Difference]: Without dead ends: 162 [2025-03-17 06:12:32,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:32,871 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 210 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:32,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 304 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:32,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-17 06:12:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 140. [2025-03-17 06:12:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 123 states have (on average 1.4308943089430894) internal successors, (176), 123 states have internal predecessors, (176), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:32,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 206 transitions. [2025-03-17 06:12:32,882 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 206 transitions. Word has length 118 [2025-03-17 06:12:32,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:32,883 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 206 transitions. [2025-03-17 06:12:32,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 206 transitions. [2025-03-17 06:12:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:12:32,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:32,885 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:32,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 06:12:32,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:32,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:32,886 INFO L85 PathProgramCache]: Analyzing trace with hash -56226197, now seen corresponding path program 1 times [2025-03-17 06:12:32,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:32,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200302504] [2025-03-17 06:12:32,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:32,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:32,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:12:32,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:12:32,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:32,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:33,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 06:12:33,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200302504] [2025-03-17 06:12:33,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200302504] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:33,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:33,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 06:12:33,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652303929] [2025-03-17 06:12:33,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:33,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 06:12:33,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 06:12:33,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 06:12:33,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 06:12:33,369 INFO L87 Difference]: Start difference. First operand 140 states and 206 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:33,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:33,747 INFO L93 Difference]: Finished difference Result 305 states and 446 transitions. [2025-03-17 06:12:33,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 06:12:33,747 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2025-03-17 06:12:33,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:33,748 INFO L225 Difference]: With dead ends: 305 [2025-03-17 06:12:33,748 INFO L226 Difference]: Without dead ends: 166 [2025-03-17 06:12:33,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-17 06:12:33,749 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 140 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:33,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 461 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 06:12:33,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-17 06:12:33,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 143. [2025-03-17 06:12:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 126 states have (on average 1.4365079365079365) internal successors, (181), 126 states have internal predecessors, (181), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 211 transitions. [2025-03-17 06:12:33,758 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 211 transitions. Word has length 121 [2025-03-17 06:12:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:33,758 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 211 transitions. [2025-03-17 06:12:33,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:33,759 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 211 transitions. [2025-03-17 06:12:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-17 06:12:33,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:33,760 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:33,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 06:12:33,760 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:33,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:33,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1272438049, now seen corresponding path program 1 times [2025-03-17 06:12:33,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 06:12:33,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747099932] [2025-03-17 06:12:33,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:33,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 06:12:33,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:12:33,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:12:33,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:33,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 06:12:33,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1366344536] [2025-03-17 06:12:33,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:33,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 06:12:33,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:33,858 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 06:12:33,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 06:12:33,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:12:34,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:12:34,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:34,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:12:34,571 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 06:12:34,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-17 06:12:37,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-17 06:12:37,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:37,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 06:12:37,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 06:12:37,385 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 06:12:37,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 06:12:37,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 06:12:37,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 06:12:37,590 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:37,669 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 06:12:37,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 06:12:37 BoogieIcfgContainer [2025-03-17 06:12:37,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 06:12:37,672 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 06:12:37,672 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 06:12:37,672 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 06:12:37,673 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:11:56" (3/4) ... [2025-03-17 06:12:37,677 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 06:12:37,678 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 06:12:37,678 INFO L158 Benchmark]: Toolchain (without parser) took 42222.99ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 105.0MB in the beginning and 312.7MB in the end (delta: -207.7MB). Peak memory consumption was 99.1MB. Max. memory is 16.1GB. [2025-03-17 06:12:37,679 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:37,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.59ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.2MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 06:12:37,679 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.94ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:37,679 INFO L158 Benchmark]: Boogie Preprocessor took 38.55ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 85.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 06:12:37,679 INFO L158 Benchmark]: IcfgBuilder took 518.58ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 52.6MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 06:12:37,679 INFO L158 Benchmark]: TraceAbstraction took 41351.83ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 52.6MB in the beginning and 312.9MB in the end (delta: -260.3MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2025-03-17 06:12:37,679 INFO L158 Benchmark]: Witness Printer took 6.14ms. Allocated memory is still 444.6MB. Free memory was 312.9MB in the beginning and 312.7MB in the end (delta: 138.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 06:12:37,680 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.59ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 90.2MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.94ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.1MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.55ms. Allocated memory is still 142.6MB. Free memory was 87.1MB in the beginning and 85.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 518.58ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 52.6MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 41351.83ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 52.6MB in the beginning and 312.9MB in the end (delta: -260.3MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. * Witness Printer took 6.14ms. Allocated memory is still 444.6MB. Free memory was 312.9MB in the beginning and 312.7MB in the end (delta: 138.5kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 124. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -100, 0, 8, 256, 500, -64, -8, 0, 0, 4.625, 15.5 }; [L49] signed short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L50] unsigned long int* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L51] unsigned long int* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L52] unsigned long int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L53] unsigned long int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L54] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L55] signed char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L56] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L57] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L58] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L59] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L133] isInitial = 1 [L134] FCALL initially() [L135] COND TRUE 1 [L136] FCALL updateLastVariables() [L137] CALL updateVariables() [L102] WrapperStruct00.var_1_2 = __VERIFIER_nondet_ulong() [L103] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L105] WrapperStruct00.var_1_3 = __VERIFIER_nondet_ulong() [L106] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_3 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L107] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_3 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L108] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ulong() [L109] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L110] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L111] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ulong() [L112] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L113] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 4294967295) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L114] WrapperStruct00.var_1_8 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L116] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L117] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L119] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L120] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L121] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L122] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L123] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L124] EXPR WrapperStruct00.var_1_13 [L124] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L124] EXPR WrapperStruct00.var_1_13 [L124] 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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L124] 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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L124] 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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, \old(cond)=1, isInitial=1] [L124] 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:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L137] RET updateVariables() [L138] CALL step() [L63] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L63] EXPR ((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L63] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L63] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L63] EXPR ((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L63] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer))))) [L64] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L64] (*(WrapperStruct00_var_1_7_Pointer)) = (*(WrapperStruct00_var_1_8_Pointer)) [L76] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L76] unsigned long int stepLocal_1 = (*(WrapperStruct00_var_1_5_Pointer)); [L77] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, stepLocal_1=-2] [L77] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L77] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, stepLocal_1=-2] [L77] unsigned long int stepLocal_0 = (*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))))); [L78] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, stepLocal_0=-21474836482, stepLocal_1=-2] [L78] COND FALSE !(stepLocal_0 < (*(WrapperStruct00_var_1_5_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L85] unsigned char stepLocal_3 = (*(WrapperStruct00_var_1_9_Pointer)); [L86] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] signed long int stepLocal_2 = (*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer)); [L87] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L87] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1, stepLocal_1=-2, stepLocal_2=26, stepLocal_3=-256] [L87] COND FALSE !((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && stepLocal_3) [L98] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L98] (*(WrapperStruct00_var_1_11_Pointer)) = (*(WrapperStruct00_var_1_13_Pointer)) [L138] RET step() [L139] CALL, EXPR property() [L129] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) [L129] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L129] EXPR (((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4))))) [L129] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer))) [L129] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L129] EXPR ((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4)))) [L129] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L129] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4)))))) && (((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) [L129] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L129] EXPR (((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer)) [L129] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L129] EXPR (((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR ((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) [L129] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L129] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L129] EXPR ((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4)))))) && (((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L129-L130] return (((((*(WrapperStruct00_var_1_2_Pointer)) * (((((*(WrapperStruct00_var_1_3_Pointer))) < ((*(WrapperStruct00_var_1_4_Pointer)))) ? ((*(WrapperStruct00_var_1_3_Pointer))) : ((*(WrapperStruct00_var_1_4_Pointer)))))) < (*(WrapperStruct00_var_1_5_Pointer))) ? (((*(WrapperStruct00_var_1_5_Pointer)) > (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_7_Pointer))))) : 1) && (((*(WrapperStruct00_var_1_2_Pointer)) < ((((((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((*(WrapperStruct00_var_1_4_Pointer)) * (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_3_Pointer)))))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_9_Pointer)) || (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_3_Pointer)) < (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_8_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((signed char) -4)))))) && (((((*(WrapperStruct00_var_1_7_Pointer)) + (*(WrapperStruct00_var_1_8_Pointer))) == (*(WrapperStruct00_var_1_4_Pointer))) && (*(WrapperStruct00_var_1_9_Pointer))) ? ((! (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_1_Pointer)) + (*(WrapperStruct00_var_1_7_Pointer))) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer)))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (*(WrapperStruct00_var_1_13_Pointer))))) ; [L139] RET, EXPR property() [L139] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:14}, WrapperStruct00_var_1_7_Pointer={4:18}, WrapperStruct00_var_1_8_Pointer={4:19}, WrapperStruct00_var_1_9_Pointer={4:20}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 147 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.2s, OverallIterations: 10, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 53 mSolverCounterUnknown, 1243 SdHoareTripleChecker+Valid, 24.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1243 mSDsluCounter, 3023 SdHoareTripleChecker+Invalid, 23.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2148 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3685 IncrementalHoareTripleChecker+Invalid, 3783 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 875 mSDtfsCounter, 3685 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 456 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 193 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 1761 NumberOfCodeBlocks, 1761 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1274 ConstructedInterpolants, 5 QuantifiedInterpolants, 13953 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1914 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 11 InterpolantComputations, 9 PerfectInterpolantSequences, 4550/4620 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-17 06:12:37,723 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-69.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 ee35e7bcfbc20dfdadfe45142e787a44862e2858c386c8809c339b2b306485b2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 06:12:39,433 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 06:12:39,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 06:12:39,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 06:12:39,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 06:12:39,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 06:12:39,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 06:12:39,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 06:12:39,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 06:12:39,537 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 06:12:39,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 06:12:39,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 06:12:39,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 06:12:39,539 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 06:12:39,539 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 06:12:39,539 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 06:12:39,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 06:12:39,539 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 06:12:39,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 06:12:39,540 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 06:12:39,541 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 06:12:39,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 06:12:39,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 06:12:39,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 06:12:39,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:39,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 06:12:39,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 06:12:39,542 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 06:12:39,542 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 06:12:39,542 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 06:12:39,542 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 06:12:39,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 06:12:39,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 06:12:39,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 06:12:39,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 06:12:39,543 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 -> ee35e7bcfbc20dfdadfe45142e787a44862e2858c386c8809c339b2b306485b2 [2025-03-17 06:12:39,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 06:12:39,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 06:12:39,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 06:12:39,774 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 06:12:39,774 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 06:12:39,775 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-69.i [2025-03-17 06:12:40,946 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a11af7a9/c5692739b3d5413eaa2667ebab7a5c36/FLAGcac7e7237 [2025-03-17 06:12:41,126 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 06:12:41,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-69.i [2025-03-17 06:12:41,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a11af7a9/c5692739b3d5413eaa2667ebab7a5c36/FLAGcac7e7237 [2025-03-17 06:12:41,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a11af7a9/c5692739b3d5413eaa2667ebab7a5c36 [2025-03-17 06:12:41,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 06:12:41,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 06:12:41,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:41,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 06:12:41,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 06:12:41,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70332d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41, skipping insertion in model container [2025-03-17 06:12:41,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 06:12:41,288 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-69.i[917,930] [2025-03-17 06:12:41,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:41,365 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 06:12:41,374 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-69.i[917,930] [2025-03-17 06:12:41,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 06:12:41,437 INFO L204 MainTranslator]: Completed translation [2025-03-17 06:12:41,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41 WrapperNode [2025-03-17 06:12:41,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 06:12:41,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:41,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 06:12:41,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 06:12:41,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,491 INFO L138 Inliner]: procedures = 37, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 477 [2025-03-17 06:12:41,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 06:12:41,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 06:12:41,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 06:12:41,496 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 06:12:41,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,538 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 30 writes are split as follows [0, 30]. [2025-03-17 06:12:41,541 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 06:12:41,579 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 06:12:41,579 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 06:12:41,579 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 06:12:41,580 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (1/1) ... [2025-03-17 06:12:41,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 06:12:41,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 06:12:41,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 06:12:41,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 06:12:41,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-17 06:12:41,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-17 06:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 06:12:41,632 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 06:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 06:12:41,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 06:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 06:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 06:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 06:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 06:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 06:12:41,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 06:12:41,733 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 06:12:41,734 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 06:12:42,356 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L129: havoc property_#t~mem77#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~ite86#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem94#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~ite93#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem95#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short99#1;havoc property_#t~ite108#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~ite107#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~short115#1;havoc property_#t~ite130#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite124#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short131#1; [2025-03-17 06:12:42,384 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2025-03-17 06:12:42,384 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 06:12:42,390 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 06:12:42,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 06:12:42,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:42 BoogieIcfgContainer [2025-03-17 06:12:42,392 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 06:12:42,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 06:12:42,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 06:12:42,397 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 06:12:42,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 06:12:41" (1/3) ... [2025-03-17 06:12:42,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f46dc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:42, skipping insertion in model container [2025-03-17 06:12:42,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 06:12:41" (2/3) ... [2025-03-17 06:12:42,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f46dc2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 06:12:42, skipping insertion in model container [2025-03-17 06:12:42,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 06:12:42" (3/3) ... [2025-03-17 06:12:42,402 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-69.i [2025-03-17 06:12:42,411 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 06:12:42,412 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-69.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 06:12:42,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 06:12:42,454 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;@2f824ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 06:12:42,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 06:12:42,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 06:12:42,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:42,464 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:42,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:42,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1566857774, now seen corresponding path program 1 times [2025-03-17 06:12:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:12:42,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369869970] [2025-03-17 06:12:42,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:42,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:42,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:12:42,478 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:12:42,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 06:12:42,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 06:12:42,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 06:12:42,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:42,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:42,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 06:12:42,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:42,780 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-17 06:12:42,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:42,782 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:12:42,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369869970] [2025-03-17 06:12:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369869970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:42,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:42,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 06:12:42,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379083718] [2025-03-17 06:12:42,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:42,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 06:12:42,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:12:42,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 06:12:42,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:12:42,808 INFO L87 Difference]: Start difference. First operand has 88 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:42,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:42,830 INFO L93 Difference]: Finished difference Result 173 states and 277 transitions. [2025-03-17 06:12:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 06:12:42,831 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 115 [2025-03-17 06:12:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:42,838 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:12:42,838 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 06:12:42,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 06:12:42,843 INFO L435 NwaCegarLoop]: 128 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, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 06:12:42,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:42,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 06:12:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2025-03-17 06:12:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2025-03-17 06:12:42,881 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 128 transitions. Word has length 115 [2025-03-17 06:12:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:42,881 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 128 transitions. [2025-03-17 06:12:42,881 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-17 06:12:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 128 transitions. [2025-03-17 06:12:42,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-17 06:12:42,884 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:42,884 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:42,892 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-17 06:12:43,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:43,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:43,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:43,090 INFO L85 PathProgramCache]: Analyzing trace with hash -496828197, now seen corresponding path program 1 times [2025-03-17 06:12:43,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:12:43,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476061651] [2025-03-17 06:12:43,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:43,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:43,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:12:43,092 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:12:43,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 06:12:43,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-17 06:12:43,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-17 06:12:43,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:43,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:43,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 06:12:43,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:43,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:43,363 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:12:43,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476061651] [2025-03-17 06:12:43,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476061651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:43,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:43,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 06:12:43,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586424258] [2025-03-17 06:12:43,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:43,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 06:12:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:12:43,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 06:12:43,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:43,366 INFO L87 Difference]: Start difference. First operand 86 states and 128 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:43,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 06:12:43,404 INFO L93 Difference]: Finished difference Result 173 states and 258 transitions. [2025-03-17 06:12:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 06:12:43,404 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 115 [2025-03-17 06:12:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 06:12:43,405 INFO L225 Difference]: With dead ends: 173 [2025-03-17 06:12:43,405 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 06:12:43,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 06:12:43,406 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 367 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-17 06:12:43,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 367 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 06:12:43,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 06:12:43,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-17 06:12:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-17 06:12:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2025-03-17 06:12:43,414 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 115 [2025-03-17 06:12:43,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 06:12:43,415 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2025-03-17 06:12:43,415 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2025-03-17 06:12:43,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-17 06:12:43,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 06:12:43,416 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 06:12:43,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 06:12:43,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:43,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 06:12:43,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 06:12:43,618 INFO L85 PathProgramCache]: Analyzing trace with hash 924543097, now seen corresponding path program 1 times [2025-03-17 06:12:43,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 06:12:43,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116165608] [2025-03-17 06:12:43,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 06:12:43,618 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 06:12:43,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 06:12:43,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 06:12:43,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-17 06:12:43,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-17 06:12:44,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-17 06:12:44,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 06:12:44,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 06:12:44,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 06:12:44,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 06:12:46,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2025-03-17 06:12:49,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 06:12:49,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 20 [2025-03-17 06:12:50,057 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-17 06:12:50,057 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 06:12:50,057 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 06:12:50,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116165608] [2025-03-17 06:12:50,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116165608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 06:12:50,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 06:12:50,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 06:12:50,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166844631] [2025-03-17 06:12:50,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 06:12:50,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 06:12:50,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 06:12:50,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 06:12:50,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=85, Unknown=1, NotChecked=0, Total=110 [2025-03-17 06:12:50,058 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-17 06:12:56,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:01,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:04,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:08,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:13:12,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:16,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-17 06:13:20,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 06:13:24,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []