./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-57.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 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:56:26,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:56:26,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:56:26,814 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:56:26,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:56:26,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:56:26,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:56:26,855 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:56:26,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:56:26,856 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:56:26,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:56:26,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:56:26,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:56:26,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:56:26,858 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:56:26,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:56:26,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:56:26,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:56:26,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:56:26,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:56:26,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:56:26,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:56:26,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:56:26,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:56:26,868 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:56:26,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:56:26,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:56:26,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:56:26,870 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:56:26,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:56:26,870 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:56:26,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:56:26,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:56:26,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:56:26,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:56:26,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:56:26,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:56:26,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:56:26,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:56:26,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:56:26,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:56:26,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:56:26,875 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 [2024-11-16 18:56:27,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:56:27,158 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:56:27,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:56:27,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:56:27,162 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:56:27,163 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-57.i [2024-11-16 18:56:28,671 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:56:28,867 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:56:28,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-16 18:56:28,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240ac7eb9/7cc15aa0012e4acc9b494518378cfc48/FLAG4401d2c4e [2024-11-16 18:56:28,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/240ac7eb9/7cc15aa0012e4acc9b494518378cfc48 [2024-11-16 18:56:28,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:56:28,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:56:28,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:56:28,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:56:28,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:56:28,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:56:28" (1/1) ... [2024-11-16 18:56:28,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@113ee380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:28, skipping insertion in model container [2024-11-16 18:56:28,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:56:28" (1/1) ... [2024-11-16 18:56:28,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:56:29,109 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-57.i[917,930] [2024-11-16 18:56:29,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:56:29,183 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:56:29,194 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-57.i[917,930] [2024-11-16 18:56:29,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:56:29,258 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:56:29,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29 WrapperNode [2024-11-16 18:56:29,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:56:29,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:56:29,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:56:29,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:56:29,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,322 INFO L138 Inliner]: procedures = 30, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2024-11-16 18:56:29,323 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:56:29,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:56:29,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:56:29,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:56:29,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,356 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-16 18:56:29,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,372 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,373 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:56:29,387 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:56:29,387 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:56:29,388 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:56:29,393 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (1/1) ... [2024-11-16 18:56:29,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:56:29,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:56:29,432 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) [2024-11-16 18:56:29,435 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 [2024-11-16 18:56:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:56:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-16 18:56:29,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-16 18:56:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-16 18:56:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 18:56:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-16 18:56:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 18:56:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:56:29,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:56:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 18:56:29,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:56:29,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:56:29,629 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:56:29,631 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:56:30,140 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~short65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem71#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~short75#1;havoc property_#t~ite90#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1; [2024-11-16 18:56:30,192 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-16 18:56:30,193 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:56:30,211 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:56:30,211 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:56:30,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:56:30 BoogieIcfgContainer [2024-11-16 18:56:30,212 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:56:30,215 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:56:30,216 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:56:30,219 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:56:30,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:56:28" (1/3) ... [2024-11-16 18:56:30,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5694c34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:56:30, skipping insertion in model container [2024-11-16 18:56:30,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:29" (2/3) ... [2024-11-16 18:56:30,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5694c34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:56:30, skipping insertion in model container [2024-11-16 18:56:30,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:56:30" (3/3) ... [2024-11-16 18:56:30,224 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-16 18:56:30,242 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:56:30,243 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:56:30,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:56:30,313 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;@14cf1828, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:56:30,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:56:30,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:56:30,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:56:30,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:56:30,330 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:56:30,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:56:30,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:56:30,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1595339270, now seen corresponding path program 1 times [2024-11-16 18:56:30,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:56:30,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317220768] [2024-11-16 18:56:30,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:56:30,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:56:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:56:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:56:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:56:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:56:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:56:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:56:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:56:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:56:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:56:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:56:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:56:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:56:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:56:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:56:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:56:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:56:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:56:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:56:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:56:30,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:56:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317220768] [2024-11-16 18:56:30,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317220768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:56:30,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:56:30,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:56:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016723980] [2024-11-16 18:56:30,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:56:30,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:56:30,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:56:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:56:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:56:30,900 INFO L87 Difference]: Start difference. First operand has 100 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:56:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:56:30,928 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2024-11-16 18:56:30,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:56:30,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2024-11-16 18:56:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:56:30,937 INFO L225 Difference]: With dead ends: 192 [2024-11-16 18:56:30,937 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 18:56:30,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:56:30,945 INFO L432 NwaCegarLoop]: 137 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, 137 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 [2024-11-16 18:56:30,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:56:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 18:56:30,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-16 18:56:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:56:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-16 18:56:30,993 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 136 [2024-11-16 18:56:30,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:56:30,995 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-16 18:56:30,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:56:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-16 18:56:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:56:30,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:56:31,001 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:56:31,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:56:31,002 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:56:31,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:56:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2004261656, now seen corresponding path program 1 times [2024-11-16 18:56:31,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:56:31,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013460625] [2024-11-16 18:56:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:56:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:56:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:56:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:31,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:56:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:56:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:56:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:56:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:56:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:56:32,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:56:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:56:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:56:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:56:32,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:56:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:56:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:56:32,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:56:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:56:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:56:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:56:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:56:32,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:56:32,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013460625] [2024-11-16 18:56:32,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013460625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:56:32,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:56:32,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:56:32,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940791349] [2024-11-16 18:56:32,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:56:32,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:56:32,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:56:32,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:56:32,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:56:32,132 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:56:32,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:56:32,499 INFO L93 Difference]: Finished difference Result 281 states and 407 transitions. [2024-11-16 18:56:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:56:32,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-11-16 18:56:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:56:32,504 INFO L225 Difference]: With dead ends: 281 [2024-11-16 18:56:32,506 INFO L226 Difference]: Without dead ends: 189 [2024-11-16 18:56:32,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:56:32,509 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 96 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:56:32,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 308 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:56:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-16 18:56:32,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 156. [2024-11-16 18:56:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 117 states have internal predecessors, (152), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:56:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 224 transitions. [2024-11-16 18:56:32,560 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 224 transitions. Word has length 136 [2024-11-16 18:56:32,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:56:32,560 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 224 transitions. [2024-11-16 18:56:32,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:56:32,561 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 224 transitions. [2024-11-16 18:56:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:56:32,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:56:32,565 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:56:32,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:56:32,565 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:56:32,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:56:32,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1832576262, now seen corresponding path program 1 times [2024-11-16 18:56:32,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:56:32,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448132604] [2024-11-16 18:56:32,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:56:32,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:56:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:56:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:56:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:56:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:56:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:56:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:56:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:56:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:56:33,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:56:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:56:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:33,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:56:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:34,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:56:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:34,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:56:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:34,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:56:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:34,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:56:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:34,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:56:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:34,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:56:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:34,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:56:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:34,068 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:56:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:56:34,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448132604] [2024-11-16 18:56:34,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448132604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:56:34,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:56:34,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:56:34,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862921854] [2024-11-16 18:56:34,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:56:34,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:56:34,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:56:34,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:56:34,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:56:34,076 INFO L87 Difference]: Start difference. First operand 156 states and 224 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:56:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:56:34,809 INFO L93 Difference]: Finished difference Result 312 states and 452 transitions. [2024-11-16 18:56:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:56:34,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2024-11-16 18:56:34,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:56:34,815 INFO L225 Difference]: With dead ends: 312 [2024-11-16 18:56:34,817 INFO L226 Difference]: Without dead ends: 220 [2024-11-16 18:56:34,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:56:34,818 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 430 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:56:34,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 372 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:56:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-16 18:56:34,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 191. [2024-11-16 18:56:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.3486842105263157) internal successors, (205), 152 states have internal predecessors, (205), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:56:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 277 transitions. [2024-11-16 18:56:34,864 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 277 transitions. Word has length 143 [2024-11-16 18:56:34,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:56:34,864 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 277 transitions. [2024-11-16 18:56:34,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:56:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 277 transitions. [2024-11-16 18:56:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:56:34,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:56:34,872 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:56:34,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:56:34,872 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:56:34,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:56:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1539173255, now seen corresponding path program 1 times [2024-11-16 18:56:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:56:34,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840043347] [2024-11-16 18:56:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:56:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:56:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:56:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:56:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:56:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:56:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:56:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:56:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:56:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:56:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:56:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:56:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:56:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:56:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:56:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:56:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:56:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:56:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:56:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:56:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:56:35,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:56:35,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840043347] [2024-11-16 18:56:35,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840043347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:56:35,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:56:35,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:56:35,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718665195] [2024-11-16 18:56:35,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:56:35,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:56:35,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:56:35,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:56:35,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:56:35,955 INFO L87 Difference]: Start difference. First operand 191 states and 277 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:56:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:56:36,489 INFO L93 Difference]: Finished difference Result 346 states and 504 transitions. [2024-11-16 18:56:36,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:56:36,490 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2024-11-16 18:56:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:56:36,494 INFO L225 Difference]: With dead ends: 346 [2024-11-16 18:56:36,495 INFO L226 Difference]: Without dead ends: 233 [2024-11-16 18:56:36,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:56:36,498 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 355 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:56:36,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 425 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:56:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-16 18:56:36,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 154. [2024-11-16 18:56:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 115 states have internal predecessors, (147), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:56:36,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 219 transitions. [2024-11-16 18:56:36,541 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 219 transitions. Word has length 143 [2024-11-16 18:56:36,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:56:36,543 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 219 transitions. [2024-11-16 18:56:36,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:56:36,543 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 219 transitions. [2024-11-16 18:56:36,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 18:56:36,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:56:36,545 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:56:36,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:56:36,545 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:56:36,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:56:36,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1745982923, now seen corresponding path program 1 times [2024-11-16 18:56:36,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:56:36,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654871095] [2024-11-16 18:56:36,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:56:36,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:56:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:56:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:56:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:56:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:56:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:56:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:56:38,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:56:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:56:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:56:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:56:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:56:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:56:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:56:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:56:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:56:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:56:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:56:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:56:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:56:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:56:38,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654871095] [2024-11-16 18:56:38,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654871095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:56:38,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:56:38,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:56:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143819873] [2024-11-16 18:56:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:56:38,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:56:38,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:56:38,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:56:38,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:56:38,749 INFO L87 Difference]: Start difference. First operand 154 states and 219 transitions. Second operand has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-16 18:56:39,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:56:39,556 INFO L93 Difference]: Finished difference Result 317 states and 452 transitions. [2024-11-16 18:56:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:56:39,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 146 [2024-11-16 18:56:39,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:56:39,560 INFO L225 Difference]: With dead ends: 317 [2024-11-16 18:56:39,560 INFO L226 Difference]: Without dead ends: 211 [2024-11-16 18:56:39,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:56:39,561 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 268 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:56:39,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 377 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:56:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-16 18:56:39,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2024-11-16 18:56:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 164 states have internal predecessors, (215), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:56:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 291 transitions. [2024-11-16 18:56:39,602 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 291 transitions. Word has length 146 [2024-11-16 18:56:39,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:56:39,602 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 291 transitions. [2024-11-16 18:56:39,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.428571428571429) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-16 18:56:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 291 transitions. [2024-11-16 18:56:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-16 18:56:39,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:56:39,607 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:56:39,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:56:39,607 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:56:39,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:56:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1304219892, now seen corresponding path program 1 times [2024-11-16 18:56:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:56:39,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961379707] [2024-11-16 18:56:39,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:56:39,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:56:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:56:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:56:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:56:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:56:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:56:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:56:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:56:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:56:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:56:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:56:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:56:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:56:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:56:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:56:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:56:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:56:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:56:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:56:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:59,936 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:56:59,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:56:59,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961379707] [2024-11-16 18:56:59,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961379707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:56:59,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:56:59,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:56:59,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783170891] [2024-11-16 18:56:59,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:56:59,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:56:59,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:56:59,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:56:59,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:56:59,939 INFO L87 Difference]: Start difference. First operand 205 states and 291 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:14,938 INFO L93 Difference]: Finished difference Result 403 states and 573 transitions. [2024-11-16 18:57:14,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:57:14,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 146 [2024-11-16 18:57:14,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:14,942 INFO L225 Difference]: With dead ends: 403 [2024-11-16 18:57:14,942 INFO L226 Difference]: Without dead ends: 246 [2024-11-16 18:57:14,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:57:14,948 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 162 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:14,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 496 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 18:57:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-16 18:57:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 221. [2024-11-16 18:57:14,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 179 states have (on average 1.324022346368715) internal successors, (237), 180 states have internal predecessors, (237), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:57:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 313 transitions. [2024-11-16 18:57:14,997 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 313 transitions. Word has length 146 [2024-11-16 18:57:14,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:14,997 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 313 transitions. [2024-11-16 18:57:14,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 313 transitions. [2024-11-16 18:57:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:57:14,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:14,999 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:15,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:57:15,000 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:15,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:15,000 INFO L85 PathProgramCache]: Analyzing trace with hash 629415149, now seen corresponding path program 1 times [2024-11-16 18:57:15,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:15,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874645486] [2024-11-16 18:57:15,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:15,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:15,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:57:15,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:15,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874645486] [2024-11-16 18:57:15,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874645486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:15,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:15,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:57:15,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250126925] [2024-11-16 18:57:15,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:15,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:57:15,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:57:15,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:57:15,337 INFO L87 Difference]: Start difference. First operand 221 states and 313 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:15,661 INFO L93 Difference]: Finished difference Result 434 states and 617 transitions. [2024-11-16 18:57:15,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:57:15,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:57:15,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:15,664 INFO L225 Difference]: With dead ends: 434 [2024-11-16 18:57:15,664 INFO L226 Difference]: Without dead ends: 261 [2024-11-16 18:57:15,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:57:15,666 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 44 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:15,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 452 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:57:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-16 18:57:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 230. [2024-11-16 18:57:15,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 188 states have (on average 1.3191489361702127) internal successors, (248), 189 states have internal predecessors, (248), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:57:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2024-11-16 18:57:15,701 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 147 [2024-11-16 18:57:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:15,701 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2024-11-16 18:57:15,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2024-11-16 18:57:15,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:57:15,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:15,704 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:15,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:57:15,704 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:15,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:15,705 INFO L85 PathProgramCache]: Analyzing trace with hash 118880972, now seen corresponding path program 1 times [2024-11-16 18:57:15,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:15,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796917192] [2024-11-16 18:57:15,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:15,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:15,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,028 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:57:16,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:16,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796917192] [2024-11-16 18:57:16,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796917192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:16,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:16,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:57:16,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125943658] [2024-11-16 18:57:16,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:16,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:57:16,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:16,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:57:16,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:57:16,030 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:16,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:16,267 INFO L93 Difference]: Finished difference Result 445 states and 626 transitions. [2024-11-16 18:57:16,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:57:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:57:16,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:16,270 INFO L225 Difference]: With dead ends: 445 [2024-11-16 18:57:16,271 INFO L226 Difference]: Without dead ends: 263 [2024-11-16 18:57:16,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:57:16,272 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 98 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:16,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 354 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:57:16,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-16 18:57:16,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 230. [2024-11-16 18:57:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 188 states have (on average 1.3085106382978724) internal successors, (246), 189 states have internal predecessors, (246), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:57:16,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 322 transitions. [2024-11-16 18:57:16,311 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 322 transitions. Word has length 147 [2024-11-16 18:57:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:16,312 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 322 transitions. [2024-11-16 18:57:16,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 322 transitions. [2024-11-16 18:57:16,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:57:16,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:16,315 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:16,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:57:16,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:16,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:16,315 INFO L85 PathProgramCache]: Analyzing trace with hash -725590899, now seen corresponding path program 1 times [2024-11-16 18:57:16,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:16,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863498411] [2024-11-16 18:57:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:16,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:57:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:16,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863498411] [2024-11-16 18:57:16,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863498411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:16,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:16,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:57:16,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847016228] [2024-11-16 18:57:16,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:16,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:57:16,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:16,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:57:16,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:57:16,634 INFO L87 Difference]: Start difference. First operand 230 states and 322 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:16,865 INFO L93 Difference]: Finished difference Result 445 states and 624 transitions. [2024-11-16 18:57:16,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:57:16,866 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:57:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:16,868 INFO L225 Difference]: With dead ends: 445 [2024-11-16 18:57:16,868 INFO L226 Difference]: Without dead ends: 263 [2024-11-16 18:57:16,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:57:16,869 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 84 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:16,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 356 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:57:16,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-16 18:57:16,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 237. [2024-11-16 18:57:16,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 195 states have (on average 1.3025641025641026) internal successors, (254), 196 states have internal predecessors, (254), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:57:16,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 330 transitions. [2024-11-16 18:57:16,900 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 330 transitions. Word has length 147 [2024-11-16 18:57:16,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:16,901 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 330 transitions. [2024-11-16 18:57:16,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:16,901 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 330 transitions. [2024-11-16 18:57:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-16 18:57:16,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:16,903 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:16,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:57:16,903 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:16,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash -596508180, now seen corresponding path program 1 times [2024-11-16 18:57:16,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:16,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056212713] [2024-11-16 18:57:16,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:16,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:17,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:17,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:17,216 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:57:17,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:17,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056212713] [2024-11-16 18:57:17,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056212713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:17,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:17,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:57:17,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574070388] [2024-11-16 18:57:17,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:17,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:57:17,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:17,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:57:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:57:17,218 INFO L87 Difference]: Start difference. First operand 237 states and 330 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:17,481 INFO L93 Difference]: Finished difference Result 452 states and 630 transitions. [2024-11-16 18:57:17,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:57:17,482 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2024-11-16 18:57:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:17,486 INFO L225 Difference]: With dead ends: 452 [2024-11-16 18:57:17,486 INFO L226 Difference]: Without dead ends: 263 [2024-11-16 18:57:17,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:57:17,487 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 81 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:17,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 370 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:57:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-16 18:57:17,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 236. [2024-11-16 18:57:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 194 states have (on average 1.288659793814433) internal successors, (250), 195 states have internal predecessors, (250), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-16 18:57:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 326 transitions. [2024-11-16 18:57:17,516 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 326 transitions. Word has length 147 [2024-11-16 18:57:17,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:17,518 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 326 transitions. [2024-11-16 18:57:17,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:17,518 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 326 transitions. [2024-11-16 18:57:17,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:57:17,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:17,519 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:17,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:57:17,520 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:17,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:17,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1689230129, now seen corresponding path program 1 times [2024-11-16 18:57:17,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:17,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150212005] [2024-11-16 18:57:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:17,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:19,505 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:57:19,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:19,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150212005] [2024-11-16 18:57:19,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150212005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:19,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:19,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:57:19,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723275196] [2024-11-16 18:57:19,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:19,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:57:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:19,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:57:19,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:57:19,508 INFO L87 Difference]: Start difference. First operand 236 states and 326 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-16 18:57:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:20,088 INFO L93 Difference]: Finished difference Result 394 states and 552 transitions. [2024-11-16 18:57:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:57:20,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 149 [2024-11-16 18:57:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:20,091 INFO L225 Difference]: With dead ends: 394 [2024-11-16 18:57:20,091 INFO L226 Difference]: Without dead ends: 206 [2024-11-16 18:57:20,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:57:20,092 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 125 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:20,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 313 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:57:20,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-16 18:57:20,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-11-16 18:57:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 165 states have (on average 1.290909090909091) internal successors, (213), 165 states have internal predecessors, (213), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:57:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 285 transitions. [2024-11-16 18:57:20,127 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 285 transitions. Word has length 149 [2024-11-16 18:57:20,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:20,127 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 285 transitions. [2024-11-16 18:57:20,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-16 18:57:20,128 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 285 transitions. [2024-11-16 18:57:20,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:57:20,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:20,130 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:20,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:57:20,131 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:20,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:20,131 INFO L85 PathProgramCache]: Analyzing trace with hash -154880436, now seen corresponding path program 1 times [2024-11-16 18:57:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255702222] [2024-11-16 18:57:20,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:57:20,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:20,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255702222] [2024-11-16 18:57:20,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255702222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:20,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:20,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:57:20,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827024930] [2024-11-16 18:57:20,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:20,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:57:20,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:20,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:57:20,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:57:20,383 INFO L87 Difference]: Start difference. First operand 204 states and 285 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:20,442 INFO L93 Difference]: Finished difference Result 364 states and 510 transitions. [2024-11-16 18:57:20,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:57:20,443 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2024-11-16 18:57:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:20,444 INFO L225 Difference]: With dead ends: 364 [2024-11-16 18:57:20,444 INFO L226 Difference]: Without dead ends: 208 [2024-11-16 18:57:20,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:57:20,445 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:20,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 650 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:57:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-16 18:57:20,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2024-11-16 18:57:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 166 states have internal predecessors, (214), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:57:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2024-11-16 18:57:20,475 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 149 [2024-11-16 18:57:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:20,476 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2024-11-16 18:57:20,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2024-11-16 18:57:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:57:20,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:20,477 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:20,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:57:20,478 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:20,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash 652038476, now seen corresponding path program 1 times [2024-11-16 18:57:20,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:20,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376200651] [2024-11-16 18:57:20,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:20,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:57:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:57:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 18:57:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 18:57:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:57:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 18:57:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-16 18:57:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-16 18:57:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-16 18:57:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 18:57:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:57:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:57:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 18:57:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 18:57:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 18:57:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 18:57:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 18:57:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 18:57:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:23,523 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:57:23,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:57:23,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376200651] [2024-11-16 18:57:23,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376200651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:23,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:23,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:57:23,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489935580] [2024-11-16 18:57:23,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:23,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:57:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:57:23,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:57:23,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:57:23,526 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-16 18:57:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:24,870 INFO L93 Difference]: Finished difference Result 453 states and 630 transitions. [2024-11-16 18:57:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:57:24,870 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2024-11-16 18:57:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:24,872 INFO L225 Difference]: With dead ends: 453 [2024-11-16 18:57:24,873 INFO L226 Difference]: Without dead ends: 296 [2024-11-16 18:57:24,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-11-16 18:57:24,874 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 485 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:24,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 451 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 18:57:24,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-16 18:57:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 281. [2024-11-16 18:57:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 242 states have (on average 1.3181818181818181) internal successors, (319), 242 states have internal predecessors, (319), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:57:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 391 transitions. [2024-11-16 18:57:24,915 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 391 transitions. Word has length 149 [2024-11-16 18:57:24,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:24,916 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 391 transitions. [2024-11-16 18:57:24,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-16 18:57:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 391 transitions. [2024-11-16 18:57:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-16 18:57:24,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:24,918 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:24,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 18:57:24,918 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:24,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:24,918 INFO L85 PathProgramCache]: Analyzing trace with hash 623409325, now seen corresponding path program 1 times [2024-11-16 18:57:24,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:57:24,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779984997] [2024-11-16 18:57:24,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:24,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:57:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:57:25,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:57:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:57:25,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:57:25,383 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:57:25,384 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:57:25,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 18:57:25,388 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:25,554 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:57:25,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:57:25 BoogieIcfgContainer [2024-11-16 18:57:25,557 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:57:25,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:57:25,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:57:25,557 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:57:25,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:56:30" (3/4) ... [2024-11-16 18:57:25,560 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:57:25,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:57:25,562 INFO L158 Benchmark]: Toolchain (without parser) took 56665.27ms. Allocated memory was 172.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 114.1MB in the beginning and 622.3MB in the end (delta: -508.2MB). Peak memory consumption was 687.0MB. Max. memory is 16.1GB. [2024-11-16 18:57:25,562 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 172.0MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:57:25,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.52ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 97.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 18:57:25,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.98ms. Allocated memory is still 172.0MB. Free memory was 96.8MB in the beginning and 93.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:57:25,563 INFO L158 Benchmark]: Boogie Preprocessor took 62.58ms. Allocated memory is still 172.0MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:57:25,564 INFO L158 Benchmark]: IcfgBuilder took 824.64ms. Allocated memory is still 172.0MB. Free memory was 90.9MB in the beginning and 57.9MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-16 18:57:25,564 INFO L158 Benchmark]: TraceAbstraction took 55341.40ms. Allocated memory was 172.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 57.0MB in the beginning and 622.3MB in the end (delta: -565.4MB). Peak memory consumption was 628.3MB. Max. memory is 16.1GB. [2024-11-16 18:57:25,564 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 1.4GB. Free memory is still 622.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:57:25,566 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.10ms. Allocated memory is still 172.0MB. Free memory is still 136.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.52ms. Allocated memory is still 172.0MB. Free memory was 114.1MB in the beginning and 97.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.98ms. Allocated memory is still 172.0MB. Free memory was 96.8MB in the beginning and 93.5MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.58ms. Allocated memory is still 172.0MB. Free memory was 93.5MB in the beginning and 91.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 824.64ms. Allocated memory is still 172.0MB. Free memory was 90.9MB in the beginning and 57.9MB in the end (delta: 33.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 55341.40ms. Allocated memory was 172.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 57.0MB in the beginning and 622.3MB in the end (delta: -565.4MB). Peak memory consumption was 628.3MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 1.4GB. Free memory is still 622.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 132. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L53] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L54] unsigned char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L55] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L56] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] signed char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L58] signed char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L59] signed char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L60] signed char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L61] signed char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L62] signed char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L63] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L64] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L65] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L66] signed char last_1_WrapperStruct00_var_1_9 = 64; [L67] signed char last_1_WrapperStruct00_var_1_14 = -64; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=0, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L136] isInitial = 1 [L137] FCALL initially() [L138] COND TRUE 1 [L139] CALL updateLastVariables() [L128] EXPR WrapperStruct00.var_1_9 [L128] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L129] EXPR WrapperStruct00.var_1_14 [L129] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L139] RET updateLastVariables() [L140] CALL updateVariables() [L99] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L102] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L105] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L108] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L111] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L114] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L115] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L116] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L117] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L118] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L120] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L121] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L121] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L121] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L123] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L124] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L140] RET updateVariables() [L141] CALL step() [L71] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L71] unsigned char stepLocal_0 = (*(WrapperStruct00_var_1_6_Pointer)); [L72] COND TRUE ! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9) [L73] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L73] EXPR (*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer)) [L73] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L73] EXPR (*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_0=257] [L73] COND TRUE ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && stepLocal_0 [L74] (*(WrapperStruct00_var_1_1_Pointer)) = ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L81] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L81] EXPR ((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L81] signed long int stepLocal_3 = ((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))); [L82] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_3=18] [L82] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) < stepLocal_3 [L83] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L83] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L83] (*(WrapperStruct00_var_1_14_Pointer)) = ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))) [L87] (*(WrapperStruct00_var_1_17_Pointer)) = 128.91f [L88] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L88] unsigned char stepLocal_2 = (*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)); [L89] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L89] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_5_Pointer)); [L90] stepLocal_1 && (*(WrapperStruct00_var_1_4_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L90] stepLocal_1 && (*(WrapperStruct00_var_1_4_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_2=0] [L90] COND FALSE !(stepLocal_1 && (*(WrapperStruct00_var_1_4_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L95] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L95] (*(WrapperStruct00_var_1_9_Pointer)) = ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))) [L141] RET step() [L142] CALL, EXPR property() [L132] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L132] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L132] EXPR (*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer)) [L132] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L132] EXPR (*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer)) [L132] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L132] EXPR ((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L132] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L132] EXPR (((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))))) [L132] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L132] EXPR (*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer)) [L132] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L132] EXPR (*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))) [L132] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L132] EXPR ((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) [L132] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) [L132] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L132] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L132] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) 128.91f)) [L132] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L132] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) 128.91f)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L132-L133] return ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? ((((*(WrapperStruct00_var_1_4_Pointer)) || (*(WrapperStruct00_var_1_5_Pointer))) && (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) last_1_WrapperStruct00_var_1_14))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (*(WrapperStruct00_var_1_4_Pointer))) ? (((*(WrapperStruct00_var_1_6_Pointer)) || ((*(WrapperStruct00_var_1_14_Pointer)) == (*(WrapperStruct00_var_1_1_Pointer)))) ? ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_9_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_12_Pointer)) - (*(WrapperStruct00_var_1_13_Pointer))))))) && (((*(WrapperStruct00_var_1_12_Pointer)) < (((*(WrapperStruct00_var_1_15_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) - ((((64) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? (64) : ((*(WrapperStruct00_var_1_13_Pointer))))))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) ((64 - (*(WrapperStruct00_var_1_16_Pointer))) - (*(WrapperStruct00_var_1_13_Pointer))))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_10_Pointer))) < ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_10_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) 128.91f)) ; [L142] RET, EXPR property() [L142] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:8}, WrapperStruct00_var_1_11_Pointer={4:9}, WrapperStruct00_var_1_12_Pointer={4:10}, WrapperStruct00_var_1_13_Pointer={4:11}, WrapperStruct00_var_1_14_Pointer={4:12}, WrapperStruct00_var_1_15_Pointer={4:13}, WrapperStruct00_var_1_16_Pointer={4:14}, WrapperStruct00_var_1_17_Pointer={4:15}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_4_Pointer={4:4}, WrapperStruct00_var_1_5_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:6}, WrapperStruct00_var_1_9_Pointer={4:7}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.1s, OverallIterations: 14, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2230 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2228 mSDsluCounter, 5061 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3498 mSDsCounter, 190 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3342 IncrementalHoareTripleChecker+Invalid, 3532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 190 mSolverCounterUnsat, 1563 mSDtfsCounter, 3342 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 528 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 18.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=13, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 309 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 31.5s InterpolantComputationTime, 2034 NumberOfCodeBlocks, 2034 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1872 ConstructedInterpolants, 0 QuantifiedInterpolants, 53556 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 7956/7956 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 18:57:25,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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-57.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 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:57:27,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:57:27,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:57:27,980 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:57:27,981 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:57:28,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:57:28,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:57:28,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:57:28,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:57:28,016 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:57:28,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:57:28,017 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:57:28,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:57:28,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:57:28,018 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:57:28,018 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:57:28,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:57:28,019 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:57:28,019 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:57:28,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:57:28,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:57:28,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:57:28,024 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:57:28,024 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:57:28,025 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:57:28,025 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:57:28,025 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:57:28,025 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:57:28,025 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:57:28,026 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:57:28,026 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:57:28,026 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:57:28,026 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:57:28,027 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:57:28,027 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:57:28,027 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:57:28,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:57:28,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:57:28,029 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:57:28,029 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:57:28,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:57:28,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:57:28,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:57:28,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:57:28,031 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 3739a27a9c8740637c1508dfeaeb16861a9cb046f0a58f7010c764edaa57cdf6 [2024-11-16 18:57:28,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:57:28,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:57:28,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:57:28,390 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:57:28,391 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:57:28,393 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-57.i [2024-11-16 18:57:30,058 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:57:30,290 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:57:30,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-16 18:57:30,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e40ca23/de0237e8b02d488b9807a4941ab6c10b/FLAG49e3fbeaf [2024-11-16 18:57:30,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56e40ca23/de0237e8b02d488b9807a4941ab6c10b [2024-11-16 18:57:30,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:57:30,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:57:30,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:57:30,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:57:30,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:57:30,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:30" (1/1) ... [2024-11-16 18:57:30,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f8d3dbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:30, skipping insertion in model container [2024-11-16 18:57:30,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:57:30" (1/1) ... [2024-11-16 18:57:30,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:57:30,852 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-57.i[917,930] [2024-11-16 18:57:30,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:57:30,951 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:57:30,965 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-57.i[917,930] [2024-11-16 18:57:31,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:57:31,027 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:57:31,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31 WrapperNode [2024-11-16 18:57:31,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:57:31,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:57:31,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:57:31,030 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:57:31,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,054 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,101 INFO L138 Inliner]: procedures = 34, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 419 [2024-11-16 18:57:31,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:57:31,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:57:31,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:57:31,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:57:31,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,148 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-16 18:57:31,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,149 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:57:31,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:57:31,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:57:31,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:57:31,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (1/1) ... [2024-11-16 18:57:31,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:57:31,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:57:31,224 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) [2024-11-16 18:57:31,228 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 [2024-11-16 18:57:31,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:57:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:57:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:57:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:57:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:57:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:57:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:57:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 18:57:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 18:57:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-16 18:57:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-16 18:57:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:57:31,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:57:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-16 18:57:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-16 18:57:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:57:31,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:57:31,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-16 18:57:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-16 18:57:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:57:31,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:57:31,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:57:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:57:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 18:57:31,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 18:57:31,458 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:57:31,460 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:57:31,978 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L132: havoc property_#t~ite72#1;havoc property_#t~mem63#1;havoc property_#t~mem64#1;havoc property_#t~short65#1;havoc property_#t~mem66#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem71#1;havoc property_#t~mem73#1;havoc property_#t~mem74#1;havoc property_#t~short75#1;havoc property_#t~ite90#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~short79#1;havoc property_#t~ite86#1;havoc property_#t~mem85#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~ite84#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem89#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~short91#1;havoc property_#t~mem97#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~ite107#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~mem106#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite105#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~short108#1;havoc property_#t~mem109#1;havoc property_#t~short110#1; [2024-11-16 18:57:32,030 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-16 18:57:32,030 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:57:32,043 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:57:32,044 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:57:32,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:32 BoogieIcfgContainer [2024-11-16 18:57:32,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:57:32,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:57:32,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:57:32,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:57:32,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:57:30" (1/3) ... [2024-11-16 18:57:32,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a92c67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:32, skipping insertion in model container [2024-11-16 18:57:32,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:57:31" (2/3) ... [2024-11-16 18:57:32,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a92c67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:57:32, skipping insertion in model container [2024-11-16 18:57:32,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:57:32" (3/3) ... [2024-11-16 18:57:32,055 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-57.i [2024-11-16 18:57:32,069 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:57:32,070 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:57:32,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:57:32,155 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;@779d3854, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:57:32,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:57:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:57:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:57:32,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:32,175 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:32,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:32,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:32,181 INFO L85 PathProgramCache]: Analyzing trace with hash 10532688, now seen corresponding path program 1 times [2024-11-16 18:57:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:57:32,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995958734] [2024-11-16 18:57:32,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:32,197 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 [2024-11-16 18:57:32,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:57:32,199 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) [2024-11-16 18:57:32,200 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 [2024-11-16 18:57:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:32,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:57:32,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:57:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-16 18:57:32,571 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:57:32,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:57:32,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995958734] [2024-11-16 18:57:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995958734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:32,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:32,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:57:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586463237] [2024-11-16 18:57:32,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:32,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:57:32,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:57:32,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:57:32,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:57:32,605 INFO L87 Difference]: Start difference. First operand has 100 states, 79 states have (on average 1.379746835443038) internal successors, (109), 80 states have internal predecessors, (109), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:57:32,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:32,644 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2024-11-16 18:57:32,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:57:32,647 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2024-11-16 18:57:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:32,657 INFO L225 Difference]: With dead ends: 192 [2024-11-16 18:57:32,657 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 18:57:32,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:57:32,666 INFO L432 NwaCegarLoop]: 137 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, 137 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 [2024-11-16 18:57:32,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:57:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 18:57:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-16 18:57:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:57:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-16 18:57:32,718 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 136 [2024-11-16 18:57:32,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:32,719 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-16 18:57:32,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 18:57:32,721 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-16 18:57:32,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:57:32,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:32,724 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:32,733 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 [2024-11-16 18:57:32,924 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 [2024-11-16 18:57:32,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:32,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:32,926 INFO L85 PathProgramCache]: Analyzing trace with hash -398389698, now seen corresponding path program 1 times [2024-11-16 18:57:32,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:57:32,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225779564] [2024-11-16 18:57:32,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:32,927 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 [2024-11-16 18:57:32,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:57:32,933 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) [2024-11-16 18:57:32,934 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 [2024-11-16 18:57:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:33,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 18:57:33,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:57:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:57:33,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:57:33,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:57:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225779564] [2024-11-16 18:57:33,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225779564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:33,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:33,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:57:33,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605846687] [2024-11-16 18:57:33,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:33,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:57:33,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:57:33,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:57:33,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:57:33,280 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:33,359 INFO L93 Difference]: Finished difference Result 192 states and 278 transitions. [2024-11-16 18:57:33,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:57:33,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-11-16 18:57:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:33,366 INFO L225 Difference]: With dead ends: 192 [2024-11-16 18:57:33,366 INFO L226 Difference]: Without dead ends: 100 [2024-11-16 18:57:33,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:57:33,368 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:33,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 515 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:57:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-16 18:57:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2024-11-16 18:57:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 18:57:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-16 18:57:33,387 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 136 [2024-11-16 18:57:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:33,391 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-16 18:57:33,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-16 18:57:33,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 18:57:33,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:33,395 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:33,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 18:57:33,599 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 [2024-11-16 18:57:33,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:33,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:33,601 INFO L85 PathProgramCache]: Analyzing trace with hash -369760547, now seen corresponding path program 1 times [2024-11-16 18:57:33,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:57:33,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156325852] [2024-11-16 18:57:33,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:33,602 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 [2024-11-16 18:57:33,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:57:33,605 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) [2024-11-16 18:57:33,606 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 [2024-11-16 18:57:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:33,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 18:57:33,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:57:33,985 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 73 treesize of output 72 [2024-11-16 18:57:34,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 125 [2024-11-16 18:57:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 18:57:34,799 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:57:34,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:57:34,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156325852] [2024-11-16 18:57:34,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156325852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:57:34,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:57:34,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:57:34,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859744515] [2024-11-16 18:57:34,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:57:34,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:57:34,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:57:34,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:57:34,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:57:34,802 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:57:36,110 INFO L93 Difference]: Finished difference Result 297 states and 422 transitions. [2024-11-16 18:57:36,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:57:36,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2024-11-16 18:57:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:57:36,114 INFO L225 Difference]: With dead ends: 297 [2024-11-16 18:57:36,114 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 18:57:36,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:57:36,119 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 80 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:57:36,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 324 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 18:57:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 18:57:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 164. [2024-11-16 18:57:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:57:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 231 transitions. [2024-11-16 18:57:36,156 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 231 transitions. Word has length 136 [2024-11-16 18:57:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:57:36,157 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 231 transitions. [2024-11-16 18:57:36,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 18:57:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 231 transitions. [2024-11-16 18:57:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 18:57:36,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:57:36,163 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:57:36,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 18:57:36,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:57:36,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:57:36,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:57:36,365 INFO L85 PathProgramCache]: Analyzing trace with hash 936311636, now seen corresponding path program 1 times [2024-11-16 18:57:36,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:57:36,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728702391] [2024-11-16 18:57:36,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:57:36,365 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 [2024-11-16 18:57:36,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:57:36,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:57:36,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 18:57:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:57:36,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-16 18:57:36,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:57:37,890 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 [2024-11-16 18:57:38,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13