./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.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-42.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 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:54:49,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:54:49,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:54:49,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:54:49,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:54:49,780 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:54:49,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:54:49,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:54:49,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:54:49,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:54:49,784 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:54:49,785 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:54:49,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:54:49,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:54:49,787 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:54:49,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:54:49,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:54:49,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:54:49,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:54:49,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:54:49,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:54:49,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:54:49,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:54:49,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:54:49,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:54:49,793 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:54:49,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:54:49,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:54:49,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:54:49,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:54:49,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:54:49,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:54:49,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:54:49,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:54:49,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:54:49,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:54:49,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:54:49,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:54:49,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:54:49,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:54:49,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:54:49,797 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:54:49,797 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 -> 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01 [2024-11-16 18:54:50,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:54:50,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:54:50,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:54:50,042 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:54:50,042 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:54:50,043 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-42.i [2024-11-16 18:54:51,333 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:54:51,518 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:54:51,519 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i [2024-11-16 18:54:51,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b08ed17/57bbb06f29774f66a42bcc9adf83413f/FLAGf76793e93 [2024-11-16 18:54:51,921 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b08ed17/57bbb06f29774f66a42bcc9adf83413f [2024-11-16 18:54:51,923 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:54:51,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:54:51,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:54:51,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:54:51,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:54:51,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:54:51" (1/1) ... [2024-11-16 18:54:51,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b20c80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:51, skipping insertion in model container [2024-11-16 18:54:51,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:54:51" (1/1) ... [2024-11-16 18:54:51,962 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:54:52,093 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-42.i[917,930] [2024-11-16 18:54:52,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:54:52,150 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:54:52,162 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-42.i[917,930] [2024-11-16 18:54:52,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:54:52,258 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:54:52,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52 WrapperNode [2024-11-16 18:54:52,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:54:52,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:54:52,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:54:52,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:54:52,266 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:54:52" (1/1) ... [2024-11-16 18:54:52,280 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:54:52" (1/1) ... [2024-11-16 18:54:52,308 INFO L138 Inliner]: procedures = 30, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2024-11-16 18:54:52,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:54:52,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:54:52,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:54:52,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:54:52,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (1/1) ... [2024-11-16 18:54:52,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (1/1) ... [2024-11-16 18:54:52,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (1/1) ... [2024-11-16 18:54:52,333 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-16 18:54:52,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (1/1) ... [2024-11-16 18:54:52,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (1/1) ... [2024-11-16 18:54:52,350 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (1/1) ... [2024-11-16 18:54:52,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (1/1) ... [2024-11-16 18:54:52,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (1/1) ... [2024-11-16 18:54:52,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (1/1) ... [2024-11-16 18:54:52,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:54:52,361 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:54:52,361 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:54:52,361 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:54:52,362 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (1/1) ... [2024-11-16 18:54:52,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:54:52,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:54:52,396 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:54:52,400 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:54:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:54:52,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-16 18:54:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-16 18:54:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-16 18:54:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 18:54:52,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-16 18:54:52,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 18:54:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:54:52,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:54:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 18:54:52,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:54:52,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:54:52,558 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:54:52,561 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:54:53,007 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2024-11-16 18:54:53,046 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-16 18:54:53,046 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:54:53,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:54:53,064 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:54:53,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:54:53 BoogieIcfgContainer [2024-11-16 18:54:53,065 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:54:53,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:54:53,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:54:53,070 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:54:53,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:54:51" (1/3) ... [2024-11-16 18:54:53,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceeb3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:54:53, skipping insertion in model container [2024-11-16 18:54:53,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:54:52" (2/3) ... [2024-11-16 18:54:53,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceeb3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:54:53, skipping insertion in model container [2024-11-16 18:54:53,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:54:53" (3/3) ... [2024-11-16 18:54:53,073 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-42.i [2024-11-16 18:54:53,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:54:53,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:54:53,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:54:53,161 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;@631580b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:54:53,162 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:54:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 89 states have (on average 1.404494382022472) internal successors, (125), 90 states have internal predecessors, (125), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:54:53,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:54:53,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:54:53,176 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:53,176 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:54:53,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:54:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1235629030, now seen corresponding path program 1 times [2024-11-16 18:54:53,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:54:53,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596986345] [2024-11-16 18:54:53,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:54:53,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:54:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:54:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:54:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:54:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:54:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:54:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:54:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:54:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:54:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:54:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:54:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:54:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:53,607 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:54:53,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:54:53,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596986345] [2024-11-16 18:54:53,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596986345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:54:53,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:54:53,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:54:53,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659353006] [2024-11-16 18:54:53,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:54:53,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:54:53,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:54:53,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:54:53,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:54:53,644 INFO L87 Difference]: Start difference. First operand has 103 states, 89 states have (on average 1.404494382022472) internal successors, (125), 90 states have internal predecessors, (125), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:54:53,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:54:53,671 INFO L93 Difference]: Finished difference Result 198 states and 298 transitions. [2024-11-16 18:54:53,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:54:53,673 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-11-16 18:54:53,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:54:53,680 INFO L225 Difference]: With dead ends: 198 [2024-11-16 18:54:53,681 INFO L226 Difference]: Without dead ends: 98 [2024-11-16 18:54:53,683 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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:54:53,686 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:54:53,687 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:54:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-16 18:54:53,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-16 18:54:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:54:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-11-16 18:54:53,730 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 105 [2024-11-16 18:54:53,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:54:53,730 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-11-16 18:54:53,730 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:54:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-11-16 18:54:53,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:54:53,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:54:53,734 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:53,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:54:53,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:54:53,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:54:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash -591365901, now seen corresponding path program 1 times [2024-11-16 18:54:53,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:54:53,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592175845] [2024-11-16 18:54:53,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:54:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:54:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:54:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:54:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:54:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:54:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:54:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:54:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:54:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:54:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:54:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:54:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:54:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:54:54,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:54:54,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592175845] [2024-11-16 18:54:54,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592175845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:54:54,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:54:54,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:54:54,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211332435] [2024-11-16 18:54:54,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:54:54,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:54:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:54:54,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:54:54,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:54:54,275 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:54:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:54:54,418 INFO L93 Difference]: Finished difference Result 193 states and 271 transitions. [2024-11-16 18:54:54,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:54:54,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-16 18:54:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:54:54,420 INFO L225 Difference]: With dead ends: 193 [2024-11-16 18:54:54,420 INFO L226 Difference]: Without dead ends: 98 [2024-11-16 18:54:54,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:54:54,422 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:54:54,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 346 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:54:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-16 18:54:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-16 18:54:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:54:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-11-16 18:54:54,430 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 105 [2024-11-16 18:54:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:54:54,431 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-11-16 18:54:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:54:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-11-16 18:54:54,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:54:54,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:54:54,432 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:54,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:54:54,433 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:54:54,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:54:54,436 INFO L85 PathProgramCache]: Analyzing trace with hash 916185908, now seen corresponding path program 1 times [2024-11-16 18:54:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:54:54,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745583376] [2024-11-16 18:54:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:54:54,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:54:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:54:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:54:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:54:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:54:54,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:54:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:54:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:54:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:54:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:54:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:54:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:54:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,690 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:54:54,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:54:54,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745583376] [2024-11-16 18:54:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745583376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:54:54,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:54:54,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:54:54,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620912102] [2024-11-16 18:54:54,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:54:54,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:54:54,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:54:54,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:54:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:54:54,694 INFO L87 Difference]: Start difference. First operand 98 states and 136 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:54:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:54:54,713 INFO L93 Difference]: Finished difference Result 191 states and 266 transitions. [2024-11-16 18:54:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:54:54,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-16 18:54:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:54:54,715 INFO L225 Difference]: With dead ends: 191 [2024-11-16 18:54:54,715 INFO L226 Difference]: Without dead ends: 96 [2024-11-16 18:54:54,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:54:54,716 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:54:54,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:54:54,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-16 18:54:54,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-16 18:54:54,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:54:54,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2024-11-16 18:54:54,723 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 105 [2024-11-16 18:54:54,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:54:54,723 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2024-11-16 18:54:54,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:54:54,723 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2024-11-16 18:54:54,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:54:54,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:54:54,725 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:54,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:54:54,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:54:54,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:54:54,725 INFO L85 PathProgramCache]: Analyzing trace with hash 872851128, now seen corresponding path program 1 times [2024-11-16 18:54:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:54:54,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107895047] [2024-11-16 18:54:54,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:54:54,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:54:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:54:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:54:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:54:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:54:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:54:54,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:54:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:54:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:54:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:54:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:54:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:54:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:54:54,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:54:54,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107895047] [2024-11-16 18:54:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107895047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:54:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:54:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:54:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238962985] [2024-11-16 18:54:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:54:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:54:54,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:54:54,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:54:54,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:54:54,930 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:54:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:54:54,946 INFO L93 Difference]: Finished difference Result 187 states and 259 transitions. [2024-11-16 18:54:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:54:54,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-16 18:54:54,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:54:54,950 INFO L225 Difference]: With dead ends: 187 [2024-11-16 18:54:54,950 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 18:54:54,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:54:54,954 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:54:54,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:54:54,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 18:54:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-16 18:54:54,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:54:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 129 transitions. [2024-11-16 18:54:54,961 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 129 transitions. Word has length 105 [2024-11-16 18:54:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:54:54,962 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 129 transitions. [2024-11-16 18:54:54,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:54:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 129 transitions. [2024-11-16 18:54:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:54:54,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:54:54,964 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:54,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:54:54,964 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:54:54,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:54:54,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1331135347, now seen corresponding path program 1 times [2024-11-16 18:54:54,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:54:54,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665579770] [2024-11-16 18:54:54,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:54:54,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:54:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:54:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:54:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:54:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:54:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:54:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:54:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:54:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:54:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:54:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:54:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:54:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:54:55,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:54:55,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665579770] [2024-11-16 18:54:55,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665579770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:54:55,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:54:55,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:54:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466683095] [2024-11-16 18:54:55,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:54:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:54:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:54:55,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:54:55,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:54:55,330 INFO L87 Difference]: Start difference. First operand 94 states and 129 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:54:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:54:55,439 INFO L93 Difference]: Finished difference Result 185 states and 255 transitions. [2024-11-16 18:54:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:54:55,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-16 18:54:55,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:54:55,440 INFO L225 Difference]: With dead ends: 185 [2024-11-16 18:54:55,440 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 18:54:55,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:54:55,441 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:54:55,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 333 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:54:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 18:54:55,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-16 18:54:55,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:54:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 128 transitions. [2024-11-16 18:54:55,455 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 128 transitions. Word has length 105 [2024-11-16 18:54:55,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:54:55,455 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 128 transitions. [2024-11-16 18:54:55,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:54:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 128 transitions. [2024-11-16 18:54:55,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:54:55,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:54:55,457 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:55,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:54:55,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:54:55,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:54:55,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1362155154, now seen corresponding path program 1 times [2024-11-16 18:54:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:54:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452294998] [2024-11-16 18:54:55,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:54:55,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:54:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:54:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:54:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:54:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:54:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:54:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:54:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:54:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:54:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:54:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:54:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:54:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:54:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:54:55,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452294998] [2024-11-16 18:54:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452294998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:54:55,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:54:55,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:54:55,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243974479] [2024-11-16 18:54:55,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:54:55,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:54:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:54:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:54:55,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:54:55,806 INFO L87 Difference]: Start difference. First operand 94 states and 128 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:54:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:54:55,888 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2024-11-16 18:54:55,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:54:55,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-16 18:54:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:54:55,890 INFO L225 Difference]: With dead ends: 185 [2024-11-16 18:54:55,890 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 18:54:55,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:54:55,891 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:54:55,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 329 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:54:55,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 18:54:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-16 18:54:55,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:54:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2024-11-16 18:54:55,895 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 105 [2024-11-16 18:54:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:54:55,896 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2024-11-16 18:54:55,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:54:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2024-11-16 18:54:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:54:55,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:54:55,897 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54:55,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:54:55,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:54:55,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:54:55,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1425260333, now seen corresponding path program 1 times [2024-11-16 18:54:55,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:54:55,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77823920] [2024-11-16 18:54:55,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:54:55,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:54:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:54:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:54:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:54:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:54:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:54:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:54:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:54:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:54:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:54:59,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:54:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:54:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:54:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:54:59,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:54:59,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77823920] [2024-11-16 18:54:59,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77823920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:54:59,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:54:59,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-16 18:54:59,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693195494] [2024-11-16 18:54:59,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:54:59,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 18:54:59,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:54:59,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 18:54:59,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:54:59,510 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 18:55:00,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:55:00,504 INFO L93 Difference]: Finished difference Result 190 states and 257 transitions. [2024-11-16 18:55:00,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:55:00,505 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2024-11-16 18:55:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:55:00,506 INFO L225 Difference]: With dead ends: 190 [2024-11-16 18:55:00,506 INFO L226 Difference]: Without dead ends: 99 [2024-11-16 18:55:00,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-11-16 18:55:00,507 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 329 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:55:00,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 474 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:55:00,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-16 18:55:00,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-11-16 18:55:00,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 83 states have internal predecessors, (107), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:55:00,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2024-11-16 18:55:00,521 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 129 transitions. Word has length 105 [2024-11-16 18:55:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:55:00,521 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 129 transitions. [2024-11-16 18:55:00,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.3125) internal successors, (53), 17 states have internal predecessors, (53), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-16 18:55:00,521 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 129 transitions. [2024-11-16 18:55:00,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:55:00,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:55:00,522 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:00,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:55:00,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:55:00,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:55:00,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1296177614, now seen corresponding path program 1 times [2024-11-16 18:55:00,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:55:00,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815754433] [2024-11-16 18:55:00,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:55:00,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:55:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:55:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:55:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:55:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:55:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:55:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:55:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:55:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:55:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:55:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:55:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:55:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 18:55:01,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:55:01,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815754433] [2024-11-16 18:55:01,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815754433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:55:01,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259236287] [2024-11-16 18:55:01,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:55:01,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:55:01,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:55:01,836 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:55:01,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:55:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:02,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-16 18:55:02,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:55:03,596 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2024-11-16 18:55:03,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2024-11-16 18:55:03,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:03,705 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 30 treesize of output 14 [2024-11-16 18:55:03,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:03,815 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 26 treesize of output 21 [2024-11-16 18:55:03,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:03,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:03,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:03,932 INFO L349 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2024-11-16 18:55:03,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2024-11-16 18:55:04,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:04,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:04,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:04,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:04,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:04,100 INFO L349 Elim1Store]: treesize reduction 72, result has 27.3 percent of original size [2024-11-16 18:55:04,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 53 [2024-11-16 18:55:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 18:55:04,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:55:36,947 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 1986 treesize of output 1922 [2024-11-16 18:55:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:55:53,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259236287] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 18:55:53,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:55:53,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14, 14] total 37 [2024-11-16 18:55:53,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342192315] [2024-11-16 18:55:53,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:55:53,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:55:53,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:55:53,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:55:53,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1184, Unknown=11, NotChecked=0, Total=1332 [2024-11-16 18:55:53,663 INFO L87 Difference]: Start difference. First operand 96 states and 129 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:55:54,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:55:54,663 INFO L93 Difference]: Finished difference Result 190 states and 255 transitions. [2024-11-16 18:55:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:55:54,664 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-16 18:55:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:55:54,665 INFO L225 Difference]: With dead ends: 190 [2024-11-16 18:55:54,665 INFO L226 Difference]: Without dead ends: 97 [2024-11-16 18:55:54,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 49.6s TimeCoverageRelationStatistics Valid=196, Invalid=1599, Unknown=11, NotChecked=0, Total=1806 [2024-11-16 18:55:54,666 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 311 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:55:54,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 595 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:55:54,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-16 18:55:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-11-16 18:55:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 81 states have (on average 1.271604938271605) internal successors, (103), 81 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:55:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 125 transitions. [2024-11-16 18:55:54,678 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 125 transitions. Word has length 105 [2024-11-16 18:55:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:55:54,678 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 125 transitions. [2024-11-16 18:55:54,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 13 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:55:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 125 transitions. [2024-11-16 18:55:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 18:55:54,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:55:54,679 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:54,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:55:54,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:55:54,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:55:54,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:55:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1900374805, now seen corresponding path program 1 times [2024-11-16 18:55:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:55:54,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559007112] [2024-11-16 18:55:54,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:55:54,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:55:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:55:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:55:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:55:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 18:55:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:55:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:55:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:55:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:55:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:55:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:55:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 18:55:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-16 18:55:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:55:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559007112] [2024-11-16 18:55:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559007112] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:55:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772842086] [2024-11-16 18:55:56,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:55:56,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:55:56,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:55:56,224 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:55:56,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 18:55:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:55:56,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-16 18:55:56,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:55:57,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:55:57,633 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 [2024-11-16 18:55:57,959 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 [2024-11-16 18:55:58,294 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 [2024-11-16 18:55:58,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:58,643 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2024-11-16 18:55:58,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 39 [2024-11-16 18:55:58,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:58,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:58,782 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-16 18:55:58,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2024-11-16 18:55:58,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:58,866 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 [2024-11-16 18:55:58,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:58,939 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2024-11-16 18:55:58,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2024-11-16 18:55:59,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 18:55:59,024 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2024-11-16 18:55:59,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 38 [2024-11-16 18:55:59,030 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 80 proven. 84 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-16 18:55:59,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:56:07,554 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 Int) (~WrapperStruct00_var_1_9_Pointer~0.offset Int) (~WrapperStruct00_var_1_18_Pointer~0.offset Int) (~WrapperStruct00_var_1_9_Pointer~0.base Int) (v_ArrVal_876 Int) (~WrapperStruct00_var_1_18_Pointer~0.base Int)) (< (mod (select (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select |c_#memory_int| c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset (+ (mod (select (select |c_#memory_int| ~WrapperStruct00_var_1_9_Pointer~0.base) ~WrapperStruct00_var_1_9_Pointer~0.offset) 256) 100))))) (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base (store (select .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.base) c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_874))))) (store .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset v_ArrVal_876))))) (store .cse0 c_~WrapperStruct00_var_1_17_Pointer~0.base (store (select .cse0 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select (select .cse0 ~WrapperStruct00_var_1_18_Pointer~0.base) ~WrapperStruct00_var_1_18_Pointer~0.offset)))) c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset) 256) 1)) is different from false [2024-11-16 18:56:07,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772842086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:56:07,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:56:07,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-11-16 18:56:07,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882410906] [2024-11-16 18:56:07,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:56:07,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-16 18:56:07,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:56:07,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-16 18:56:07,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=564, Unknown=1, NotChecked=50, Total=756 [2024-11-16 18:56:07,582 INFO L87 Difference]: Start difference. First operand 94 states and 125 transitions. Second operand has 24 states, 22 states have (on average 4.590909090909091) internal successors, (101), 24 states have internal predecessors, (101), 9 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-16 18:56:08,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:56:08,476 INFO L93 Difference]: Finished difference Result 207 states and 274 transitions. [2024-11-16 18:56:08,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 18:56:08,478 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 4.590909090909091) internal successors, (101), 24 states have internal predecessors, (101), 9 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) Word has length 107 [2024-11-16 18:56:08,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:56:08,478 INFO L225 Difference]: With dead ends: 207 [2024-11-16 18:56:08,479 INFO L226 Difference]: Without dead ends: 116 [2024-11-16 18:56:08,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=278, Invalid=847, Unknown=1, NotChecked=64, Total=1190 [2024-11-16 18:56:08,481 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 188 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 18:56:08,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 564 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 18:56:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-16 18:56:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2024-11-16 18:56:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 95 states have internal predecessors, (118), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:56:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 146 transitions. [2024-11-16 18:56:08,503 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 146 transitions. Word has length 107 [2024-11-16 18:56:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:56:08,504 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 146 transitions. [2024-11-16 18:56:08,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 4.590909090909091) internal successors, (101), 24 states have internal predecessors, (101), 9 states have call successors, (22), 4 states have call predecessors, (22), 6 states have return successors, (22), 7 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-16 18:56:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 146 transitions. [2024-11-16 18:56:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 18:56:08,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:56:08,506 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 18:56:08,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-16 18:56:08,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:56:08,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:56:08,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1116105270, now seen corresponding path program 1 times [2024-11-16 18:56:08,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:56:08,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790759891] [2024-11-16 18:56:08,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:56:08,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:56:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:56:08,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:56:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:56:08,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:56:08,986 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:56:08,987 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:56:08,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:56:08,991 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:56:09,087 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:56:09,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:56:09 BoogieIcfgContainer [2024-11-16 18:56:09,089 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:56:09,090 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:56:09,090 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:56:09,090 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:56:09,090 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:54:53" (3/4) ... [2024-11-16 18:56:09,092 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:56:09,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:56:09,094 INFO L158 Benchmark]: Toolchain (without parser) took 77169.64ms. Allocated memory was 146.8MB in the beginning and 532.7MB in the end (delta: 385.9MB). Free memory was 74.1MB in the beginning and 447.2MB in the end (delta: -373.2MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-16 18:56:09,094 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:56:09,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.21ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 73.9MB in the beginning and 185.9MB in the end (delta: -112.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-16 18:56:09,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.76ms. Allocated memory is still 216.0MB. Free memory was 185.9MB in the beginning and 182.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:56:09,095 INFO L158 Benchmark]: Boogie Preprocessor took 50.57ms. Allocated memory is still 216.0MB. Free memory was 182.8MB in the beginning and 179.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:56:09,095 INFO L158 Benchmark]: IcfgBuilder took 704.81ms. Allocated memory is still 216.0MB. Free memory was 179.6MB in the beginning and 144.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-16 18:56:09,095 INFO L158 Benchmark]: TraceAbstraction took 76022.00ms. Allocated memory was 216.0MB in the beginning and 532.7MB in the end (delta: 316.7MB). Free memory was 142.9MB in the beginning and 447.2MB in the end (delta: -304.3MB). Peak memory consumption was 278.7MB. Max. memory is 16.1GB. [2024-11-16 18:56:09,095 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 532.7MB. Free memory is still 447.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:56:09,096 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.19ms. Allocated memory is still 146.8MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.21ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 73.9MB in the beginning and 185.9MB in the end (delta: -112.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.76ms. Allocated memory is still 216.0MB. Free memory was 185.9MB in the beginning and 182.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.57ms. Allocated memory is still 216.0MB. Free memory was 182.8MB in the beginning and 179.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 704.81ms. Allocated memory is still 216.0MB. Free memory was 179.6MB in the beginning and 144.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 76022.00ms. Allocated memory was 216.0MB in the beginning and 532.7MB in the end (delta: 316.7MB). Free memory was 142.9MB in the beginning and 447.2MB in the end (delta: -304.3MB). Peak memory consumption was 278.7MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 532.7MB. Free memory is still 447.2MB. 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 109. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { -1, 5, 4, 16.5, 127.25, 1, 0, 0, 0, 0, 0 }; [L49] signed long int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L50] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L51] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L52] float* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L53] float* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L54] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L55] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L56] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L57] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L58] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L59] unsigned char* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=0] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L88] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L89] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L90] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L91] WrapperStruct00.var_1_11 = __VERIFIER_nondet_float() [L92] EXPR WrapperStruct00.var_1_11 [L92] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L92] EXPR WrapperStruct00.var_1_11 [L92] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L92] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L92] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L92] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L93] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L94] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L95] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L96] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L97] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L98] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L99] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L101] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L102] WrapperStruct00.var_1_18 = __VERIFIER_nondet_uchar() [L103] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_18 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_18 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_18 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L117] RET updateVariables() [L118] CALL step() [L63] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L63] (*(WrapperStruct00_var_1_8_Pointer)) = ((*(WrapperStruct00_var_1_9_Pointer)) + 100) [L64] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L64] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) [L64] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L64] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L64] (*(WrapperStruct00_var_1_10_Pointer)) = (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))) [L65] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L65] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L65] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L68] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L68] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L68] (*(WrapperStruct00_var_1_1_Pointer)) = ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))))) [L70] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L70] COND TRUE (*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L71] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer)) [L72] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L72] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L81] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L81] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L81] COND FALSE !((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L84] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L84] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L84] (*(WrapperStruct00_var_1_12_Pointer)) = (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))) [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))))))) [L109] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100))) [L109] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L109] EXPR (((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))))) [L109] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L109] EXPR \read(*WrapperStruct00_var_1_11_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) [L109] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L109] EXPR (((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))) && (((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : 1) : (((*(WrapperStruct00_var_1_8_Pointer)) <= 1000000) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L109-L110] return ((((((*(WrapperStruct00_var_1_8_Pointer)) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_8_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) - 10))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed long int) ((((((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) > (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))) ? (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) : (((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer))))))))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_9_Pointer)) + 100)))) && ((*(WrapperStruct00_var_1_10_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_11_Pointer))) < (64.15f)) ? ((*(WrapperStruct00_var_1_11_Pointer))) : (64.15f)))))) && (((- (*(WrapperStruct00_var_1_10_Pointer))) > (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_13_Pointer)) || ((*(WrapperStruct00_var_1_17_Pointer)) && ((*(WrapperStruct00_var_1_15_Pointer)) || (*(WrapperStruct00_var_1_16_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (((*(WrapperStruct00_var_1_1_Pointer)) <= (*(WrapperStruct00_var_1_9_Pointer))) && (*(WrapperStruct00_var_1_16_Pointer))))))) && (((*(WrapperStruct00_var_1_11_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? (((*(WrapperStruct00_var_1_1_Pointer)) != (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_18_Pointer)))) : 1) : (((*(WrapperStruct00_var_1_8_Pointer)) <= 1000000) ? ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_17_Pointer)) == ((unsigned char) 0)))) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_11_Pointer={4:10}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_15_Pointer={4:16}, WrapperStruct00_var_1_16_Pointer={4:17}, WrapperStruct00_var_1_17_Pointer={4:18}, WrapperStruct00_var_1_18_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.9s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 835 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 828 mSDsluCounter, 3290 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2272 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1657 IncrementalHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 1018 mSDtfsCounter, 1657 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 651 GetRequests, 544 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 60.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 70.3s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1252 ConstructedInterpolants, 21 QuantifiedInterpolants, 16258 SizeOfPredicates, 44 NumberOfNonLiveVariables, 925 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 2490/2640 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:56:09,141 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-42.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 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:56:11,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:56:11,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:56:11,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:56:11,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:56:11,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:56:11,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:56:11,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:56:11,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:56:11,210 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:56:11,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:56:11,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:56:11,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:56:11,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:56:11,211 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:56:11,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:56:11,211 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:56:11,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:56:11,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:56:11,212 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:56:11,212 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:56:11,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:56:11,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:56:11,213 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:56:11,214 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:56:11,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:56:11,214 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:56:11,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:56:11,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:56:11,215 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:56:11,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:56:11,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:56:11,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:56:11,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:56:11,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:56:11,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:56:11,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:56:11,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:56:11,217 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:56:11,218 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:56:11,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:56:11,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:56:11,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:56:11,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:56:11,219 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 -> 3d976df0441559782faf2252bd19993d5a8987fee3e7cd12d006e6d9859f8f01 [2024-11-16 18:56:11,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:56:11,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:56:11,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:56:11,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:56:11,530 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:56:11,531 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-42.i [2024-11-16 18:56:12,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:56:13,179 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:56:13,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-42.i [2024-11-16 18:56:13,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0e458ed/d29bb5e9a0af4b35bbd1c88e325ba7fe/FLAG7f0ee5734 [2024-11-16 18:56:13,552 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0e458ed/d29bb5e9a0af4b35bbd1c88e325ba7fe [2024-11-16 18:56:13,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:56:13,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:56:13,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:56:13,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:56:13,562 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:56:13,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:56:13" (1/1) ... [2024-11-16 18:56:13,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16a161d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:13, skipping insertion in model container [2024-11-16 18:56:13,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:56:13" (1/1) ... [2024-11-16 18:56:13,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:56:13,756 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-42.i[917,930] [2024-11-16 18:56:13,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:56:13,835 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:56:13,847 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-42.i[917,930] [2024-11-16 18:56:13,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:56:13,901 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:56:13,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:13 WrapperNode [2024-11-16 18:56:13,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:56:13,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:56:13,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:56:13,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:56:13,909 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:13" (1/1) ... [2024-11-16 18:56:13,928 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:13" (1/1) ... [2024-11-16 18:56:13,959 INFO L138 Inliner]: procedures = 34, calls = 138, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2024-11-16 18:56:13,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:56:13,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:56:13,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:56:13,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:56:13,976 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:13" (1/1) ... [2024-11-16 18:56:13,977 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:13" (1/1) ... [2024-11-16 18:56:13,984 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:13" (1/1) ... [2024-11-16 18:56:14,014 INFO L175 MemorySlicer]: Split 116 memory accesses to 2 slices as follows [2, 114]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2024-11-16 18:56:14,014 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:13" (1/1) ... [2024-11-16 18:56:14,015 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:13" (1/1) ... [2024-11-16 18:56:14,037 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:13" (1/1) ... [2024-11-16 18:56:14,038 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:13" (1/1) ... [2024-11-16 18:56:14,047 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:13" (1/1) ... [2024-11-16 18:56:14,048 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:13" (1/1) ... [2024-11-16 18:56:14,056 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:56:14,057 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:56:14,057 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:56:14,057 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:56:14,057 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:13" (1/1) ... [2024-11-16 18:56:14,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:56:14,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:56:14,088 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:14,090 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:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:56:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:56:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:56:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:56:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:56:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:56:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:56:14,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 18:56:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 18:56:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-16 18:56:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-16 18:56:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:56:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:56:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-16 18:56:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-16 18:56:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:56:14,125 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:56:14,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-16 18:56:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-16 18:56:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:56:14,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:56:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:56:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:56:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 18:56:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 18:56:14,239 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:56:14,241 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:56:14,769 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: havoc property_#t~mem66#1;havoc property_#t~mem67#1;havoc property_#t~ite84#1;havoc property_#t~mem73#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~ite72#1;havoc property_#t~mem70#1;havoc property_#t~mem71#1;havoc property_#t~mem83#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~ite82#1;havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~short87#1;havoc property_#t~mem91#1;havoc property_#t~mem88#1;havoc property_#t~ite90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite108#1;havoc property_#t~mem102#1;havoc property_#t~mem100#1;havoc property_#t~mem98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~short99#1;havoc property_#t~short101#1;havoc property_#t~mem107#1;havoc property_#t~mem103#1;havoc property_#t~mem104#1;havoc property_#t~mem105#1;havoc property_#t~short106#1;havoc property_#t~short109#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~ite121#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~ite116#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem117#1;havoc property_#t~ite120#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~short122#1; [2024-11-16 18:56:14,808 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-16 18:56:14,808 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:56:14,822 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:56:14,822 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:56:14,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:56:14 BoogieIcfgContainer [2024-11-16 18:56:14,823 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:56:14,824 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:56:14,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:56:14,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:56:14,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:56:13" (1/3) ... [2024-11-16 18:56:14,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265f6d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:56:14, skipping insertion in model container [2024-11-16 18:56:14,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:56:13" (2/3) ... [2024-11-16 18:56:14,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265f6d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:56:14, skipping insertion in model container [2024-11-16 18:56:14,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:56:14" (3/3) ... [2024-11-16 18:56:14,829 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-42.i [2024-11-16 18:56:14,843 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:56:14,843 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:56:14,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:56:14,895 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;@501779ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:56:14,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:56:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 89 states have (on average 1.404494382022472) internal successors, (125), 90 states have internal predecessors, (125), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:56:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:56:14,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:56:14,922 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,923 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:56:14,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:56:14,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1854614634, now seen corresponding path program 1 times [2024-11-16 18:56:14,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:56:14,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300753451] [2024-11-16 18:56:14,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:56:14,942 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:56:14,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:56:14,943 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:56:14,944 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:56:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:15,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:56:15,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:56:15,218 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-16 18:56:15,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:56:15,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:56:15,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300753451] [2024-11-16 18:56:15,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300753451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:56:15,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:56:15,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:56:15,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995725965] [2024-11-16 18:56:15,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:56:15,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:56:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:56:15,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:56:15,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:56:15,251 INFO L87 Difference]: Start difference. First operand has 103 states, 89 states have (on average 1.404494382022472) internal successors, (125), 90 states have internal predecessors, (125), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:56:15,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:56:15,272 INFO L93 Difference]: Finished difference Result 198 states and 298 transitions. [2024-11-16 18:56:15,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:56:15,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-11-16 18:56:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:56:15,279 INFO L225 Difference]: With dead ends: 198 [2024-11-16 18:56:15,279 INFO L226 Difference]: Without dead ends: 98 [2024-11-16 18:56:15,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:15,285 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:15,285 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:15,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-16 18:56:15,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-16 18:56:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:56:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 137 transitions. [2024-11-16 18:56:15,325 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 137 transitions. Word has length 105 [2024-11-16 18:56:15,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:56:15,326 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 137 transitions. [2024-11-16 18:56:15,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-16 18:56:15,326 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 137 transitions. [2024-11-16 18:56:15,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:56:15,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:56:15,329 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,335 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:56:15,533 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:56:15,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:56:15,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:56:15,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1796089533, now seen corresponding path program 1 times [2024-11-16 18:56:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:56:15,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272311188] [2024-11-16 18:56:15,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:56:15,535 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:56:15,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:56:15,538 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:56:15,539 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:56:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:15,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 18:56:15,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:56:15,860 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 33 treesize of output 17 [2024-11-16 18:56:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 18:56:15,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:56:15,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:56:15,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272311188] [2024-11-16 18:56:15,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272311188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:56:15,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:56:15,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:56:15,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18519921] [2024-11-16 18:56:15,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:56:15,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:56:15,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:56:15,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:56:15,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:56:15,960 INFO L87 Difference]: Start difference. First operand 98 states and 137 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:56:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:56:15,988 INFO L93 Difference]: Finished difference Result 193 states and 271 transitions. [2024-11-16 18:56:15,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:56:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 105 [2024-11-16 18:56:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:56:15,993 INFO L225 Difference]: With dead ends: 193 [2024-11-16 18:56:15,993 INFO L226 Difference]: Without dead ends: 98 [2024-11-16 18:56:15,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:56:15,995 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:56:15,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:56:15,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-16 18:56:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-16 18:56:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-16 18:56:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 136 transitions. [2024-11-16 18:56:16,008 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 136 transitions. Word has length 105 [2024-11-16 18:56:16,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:56:16,009 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 136 transitions. [2024-11-16 18:56:16,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-16 18:56:16,010 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2024-11-16 18:56:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:56:16,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:56:16,013 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,023 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:56:16,217 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:56:16,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:56:16,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:56:16,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1765069726, now seen corresponding path program 1 times [2024-11-16 18:56:16,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:56:16,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235546662] [2024-11-16 18:56:16,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:56:16,220 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:56:16,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:56:16,223 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:56:16,223 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:56:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:56:16,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-16 18:56:16,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:56:16,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:56:17,881 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 [2024-11-16 18:56:18,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-11-16 18:56:19,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-16 18:56:20,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 43 [2024-11-16 18:56:21,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46