./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-49.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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-49.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 d884eeffd8b0023fc900bd81f692be364c6bc9fc89a5974af855cb50a9688a16 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:18:07,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:18:08,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:18:08,052 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:18:08,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:18:08,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:18:08,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:18:08,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:18:08,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:18:08,086 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:18:08,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:18:08,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:18:08,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:18:08,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:18:08,089 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:18:08,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:18:08,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:18:08,090 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:18:08,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:18:08,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:18:08,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:18:08,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:18:08,096 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:18:08,096 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:18:08,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:18:08,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:18:08,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:18:08,097 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:18:08,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:18:08,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:18:08,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:18:08,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:18:08,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:18:08,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:18:08,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:18:08,099 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:18:08,099 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:18:08,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:18:08,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:18:08,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:18:08,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:18:08,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:18:08,101 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 -> d884eeffd8b0023fc900bd81f692be364c6bc9fc89a5974af855cb50a9688a16 [2024-11-19 01:18:08,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:18:08,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:18:08,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:18:08,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:18:08,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:18:08,398 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-49.i [2024-11-19 01:18:09,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:18:10,141 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:18:10,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-49.i [2024-11-19 01:18:10,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a8bba5c/08467b407cb440849b51c6198defd765/FLAGcaa9a8a35 [2024-11-19 01:18:10,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23a8bba5c/08467b407cb440849b51c6198defd765 [2024-11-19 01:18:10,483 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:18:10,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:18:10,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:18:10,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:18:10,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:18:10,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:18:10" (1/1) ... [2024-11-19 01:18:10,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:10, skipping insertion in model container [2024-11-19 01:18:10,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:18:10" (1/1) ... [2024-11-19 01:18:10,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:18:10,717 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-49.i[917,930] [2024-11-19 01:18:10,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:18:10,941 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:18:10,961 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-49.i[917,930] [2024-11-19 01:18:11,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:18:11,049 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:18:11,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11 WrapperNode [2024-11-19 01:18:11,050 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:18:11,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:18:11,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:18:11,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:18:11,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,077 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,145 INFO L138 Inliner]: procedures = 30, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 670 [2024-11-19 01:18:11,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:18:11,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:18:11,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:18:11,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:18:11,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,183 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:18:11,183 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:18:11,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:18:11,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:18:11,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:18:11,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (1/1) ... [2024-11-19 01:18:11,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:18:11,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:18:11,280 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-19 01:18:11,284 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-19 01:18:11,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:18:11,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:18:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:18:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:18:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:18:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:18:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:18:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:18:11,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:18:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:18:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:18:11,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:18:11,473 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:18:11,475 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:18:12,221 INFO L? ?]: Removed 216 outVars from TransFormulas that were not future-live. [2024-11-19 01:18:12,222 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:18:12,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:18:12,242 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:18:12,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:18:12 BoogieIcfgContainer [2024-11-19 01:18:12,242 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:18:12,244 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:18:12,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:18:12,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:18:12,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:18:10" (1/3) ... [2024-11-19 01:18:12,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76648da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:18:12, skipping insertion in model container [2024-11-19 01:18:12,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:11" (2/3) ... [2024-11-19 01:18:12,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76648da8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:18:12, skipping insertion in model container [2024-11-19 01:18:12,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:18:12" (3/3) ... [2024-11-19 01:18:12,251 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-49.i [2024-11-19 01:18:12,269 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:18:12,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:18:12,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:18:12,350 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;@284a7486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:18:12,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:18:12,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 120 states have internal predecessors, (175), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:18:12,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 01:18:12,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:12,371 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:12,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:12,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:12,377 INFO L85 PathProgramCache]: Analyzing trace with hash 226772151, now seen corresponding path program 1 times [2024-11-19 01:18:12,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:12,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971439410] [2024-11-19 01:18:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:12,790 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-19 01:18:12,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:12,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971439410] [2024-11-19 01:18:12,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971439410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:12,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291882847] [2024-11-19 01:18:12,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:12,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:18:12,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:18:12,795 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-19 01:18:12,797 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-19 01:18:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:13,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:18:13,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:13,114 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-19 01:18:13,116 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291882847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:13,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:18:13,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:18:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263358300] [2024-11-19 01:18:13,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:13,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:18:13,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:18:13,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:18:13,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:18:13,158 INFO L87 Difference]: Start difference. First operand has 136 states, 119 states have (on average 1.4705882352941178) internal successors, (175), 120 states have internal predecessors, (175), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:18:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:13,192 INFO L93 Difference]: Finished difference Result 265 states and 414 transitions. [2024-11-19 01:18:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:18:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-11-19 01:18:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:13,205 INFO L225 Difference]: With dead ends: 265 [2024-11-19 01:18:13,207 INFO L226 Difference]: Without dead ends: 132 [2024-11-19 01:18:13,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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-19 01:18:13,216 INFO L432 NwaCegarLoop]: 196 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, 196 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-19 01:18:13,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:18:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-19 01:18:13,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-19 01:18:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 116 states have internal predecessors, (168), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:18:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 196 transitions. [2024-11-19 01:18:13,260 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 196 transitions. Word has length 117 [2024-11-19 01:18:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:13,260 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 196 transitions. [2024-11-19 01:18:13,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:18:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 196 transitions. [2024-11-19 01:18:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 01:18:13,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:13,266 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:13,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:18:13,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 01:18:13,468 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:13,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:13,468 INFO L85 PathProgramCache]: Analyzing trace with hash 976947295, now seen corresponding path program 1 times [2024-11-19 01:18:13,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:13,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566919104] [2024-11-19 01:18:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:13,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:18:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566919104] [2024-11-19 01:18:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566919104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:14,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:18:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250270973] [2024-11-19 01:18:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:14,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:18:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:18:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:18:14,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:18:14,330 INFO L87 Difference]: Start difference. First operand 132 states and 196 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:18:14,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:14,724 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2024-11-19 01:18:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:18:14,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2024-11-19 01:18:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:14,730 INFO L225 Difference]: With dead ends: 315 [2024-11-19 01:18:14,731 INFO L226 Difference]: Without dead ends: 186 [2024-11-19 01:18:14,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:18:14,734 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 76 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:14,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 558 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 01:18:14,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-19 01:18:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 136. [2024-11-19 01:18:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 120 states have (on average 1.4416666666666667) internal successors, (173), 120 states have internal predecessors, (173), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:18:14,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 201 transitions. [2024-11-19 01:18:14,758 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 201 transitions. Word has length 117 [2024-11-19 01:18:14,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:14,761 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 201 transitions. [2024-11-19 01:18:14,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:18:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 201 transitions. [2024-11-19 01:18:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 01:18:14,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:14,766 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:14,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:18:14,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1079645382, now seen corresponding path program 1 times [2024-11-19 01:18:14,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:14,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083298729] [2024-11-19 01:18:14,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:14,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-19 01:18:15,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:16,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083298729] [2024-11-19 01:18:16,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083298729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:16,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:16,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:18:16,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849353499] [2024-11-19 01:18:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:16,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:18:16,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:18:16,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:18:16,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:18:16,005 INFO L87 Difference]: Start difference. First operand 136 states and 201 transitions. Second operand has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 01:18:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:17,107 INFO L93 Difference]: Finished difference Result 313 states and 460 transitions. [2024-11-19 01:18:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 01:18:17,108 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2024-11-19 01:18:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:17,111 INFO L225 Difference]: With dead ends: 313 [2024-11-19 01:18:17,111 INFO L226 Difference]: Without dead ends: 180 [2024-11-19 01:18:17,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-19 01:18:17,115 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 258 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:17,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 671 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 01:18:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-19 01:18:17,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175. [2024-11-19 01:18:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 147 states have internal predecessors, (204), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:18:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 256 transitions. [2024-11-19 01:18:17,149 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 256 transitions. Word has length 119 [2024-11-19 01:18:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:17,152 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 256 transitions. [2024-11-19 01:18:17,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.5) internal successors, (55), 11 states have internal predecessors, (55), 3 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 01:18:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 256 transitions. [2024-11-19 01:18:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 01:18:17,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:17,155 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:17,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:18:17,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:17,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:17,156 INFO L85 PathProgramCache]: Analyzing trace with hash -183740364, now seen corresponding path program 1 times [2024-11-19 01:18:17,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:17,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789840951] [2024-11-19 01:18:17,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:17,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:18:20,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:20,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789840951] [2024-11-19 01:18:20,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789840951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:20,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:20,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-19 01:18:20,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090003575] [2024-11-19 01:18:20,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:20,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 01:18:20,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:18:20,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 01:18:20,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2024-11-19 01:18:20,914 INFO L87 Difference]: Start difference. First operand 175 states and 256 transitions. Second operand has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 01:18:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:24,232 INFO L93 Difference]: Finished difference Result 561 states and 832 transitions. [2024-11-19 01:18:24,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 01:18:24,234 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-11-19 01:18:24,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:24,237 INFO L225 Difference]: With dead ends: 561 [2024-11-19 01:18:24,238 INFO L226 Difference]: Without dead ends: 428 [2024-11-19 01:18:24,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2024-11-19 01:18:24,240 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 2147 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 1732 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:24,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 945 Invalid, 1885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1732 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 01:18:24,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2024-11-19 01:18:24,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 238. [2024-11-19 01:18:24,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 209 states have (on average 1.4401913875598087) internal successors, (301), 210 states have internal predecessors, (301), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:18:24,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 353 transitions. [2024-11-19 01:18:24,276 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 353 transitions. Word has length 121 [2024-11-19 01:18:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:24,277 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 353 transitions. [2024-11-19 01:18:24,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 19 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 01:18:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 353 transitions. [2024-11-19 01:18:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 01:18:24,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:24,279 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:24,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:18:24,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:24,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:24,280 INFO L85 PathProgramCache]: Analyzing trace with hash -576767374, now seen corresponding path program 1 times [2024-11-19 01:18:24,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:24,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681433773] [2024-11-19 01:18:24,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:24,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:25,671 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:18:25,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:25,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681433773] [2024-11-19 01:18:25,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681433773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:25,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:25,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 01:18:25,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432580695] [2024-11-19 01:18:25,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:25,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 01:18:25,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:18:25,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 01:18:25,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-19 01:18:25,675 INFO L87 Difference]: Start difference. First operand 238 states and 353 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 01:18:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:26,625 INFO L93 Difference]: Finished difference Result 552 states and 819 transitions. [2024-11-19 01:18:26,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:18:26,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-11-19 01:18:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:26,629 INFO L225 Difference]: With dead ends: 552 [2024-11-19 01:18:26,629 INFO L226 Difference]: Without dead ends: 356 [2024-11-19 01:18:26,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-19 01:18:26,632 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 437 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:26,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 398 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:18:26,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-19 01:18:26,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 353. [2024-11-19 01:18:26,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 314 states have (on average 1.4426751592356688) internal successors, (453), 316 states have internal predecessors, (453), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:18:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 521 transitions. [2024-11-19 01:18:26,670 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 521 transitions. Word has length 121 [2024-11-19 01:18:26,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:26,671 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 521 transitions. [2024-11-19 01:18:26,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-19 01:18:26,672 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 521 transitions. [2024-11-19 01:18:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 01:18:26,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:26,673 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:26,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 01:18:26,674 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:26,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:26,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1718624819, now seen corresponding path program 1 times [2024-11-19 01:18:26,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:26,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971042260] [2024-11-19 01:18:26,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:26,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:27,648 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-19 01:18:27,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:18:27,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971042260] [2024-11-19 01:18:27,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971042260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:27,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121604184] [2024-11-19 01:18:27,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:27,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:18:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:18:27,655 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-19 01:18:27,656 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-19 01:18:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:27,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-19 01:18:27,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:29,245 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-19 01:18:29,629 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-19 01:18:29,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:29,899 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-19 01:18:29,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:29,962 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-19 01:18:30,032 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-19 01:18:30,034 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 25 treesize of output 20 [2024-11-19 01:18:30,096 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-19 01:18:30,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2024-11-19 01:18:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 96 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-19 01:18:30,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:18:30,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121604184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:30,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:18:30,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2024-11-19 01:18:30,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970576131] [2024-11-19 01:18:30,338 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:18:30,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 01:18:30,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:18:30,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 01:18:30,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2024-11-19 01:18:30,341 INFO L87 Difference]: Start difference. First operand 353 states and 521 transitions. Second operand has 22 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 7 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2024-11-19 01:18:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:31,768 INFO L93 Difference]: Finished difference Result 738 states and 1095 transitions. [2024-11-19 01:18:31,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 01:18:31,769 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 7 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) Word has length 121 [2024-11-19 01:18:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:31,772 INFO L225 Difference]: With dead ends: 738 [2024-11-19 01:18:31,772 INFO L226 Difference]: Without dead ends: 431 [2024-11-19 01:18:31,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=711, Unknown=0, NotChecked=0, Total=930 [2024-11-19 01:18:31,775 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 359 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:31,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 1011 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 01:18:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-19 01:18:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 373. [2024-11-19 01:18:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 332 states have (on average 1.4367469879518073) internal successors, (477), 334 states have internal predecessors, (477), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:18:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 545 transitions. [2024-11-19 01:18:31,816 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 545 transitions. Word has length 121 [2024-11-19 01:18:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:31,817 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 545 transitions. [2024-11-19 01:18:31,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 5.2) internal successors, (104), 20 states have internal predecessors, (104), 7 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 7 states have call predecessors, (28), 7 states have call successors, (28) [2024-11-19 01:18:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 545 transitions. [2024-11-19 01:18:31,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 01:18:31,819 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:31,820 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:31,838 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-19 01:18:32,021 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,SelfDestructingSolverStorable5 [2024-11-19 01:18:32,021 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:32,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1989536463, now seen corresponding path program 1 times [2024-11-19 01:18:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:18:32,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367723223] [2024-11-19 01:18:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:18:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:18:32,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:18:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:18:32,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:18:32,262 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:18:32,263 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:18:32,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 01:18:32,269 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:18:32,404 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:18:32,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:18:32 BoogieIcfgContainer [2024-11-19 01:18:32,407 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:18:32,408 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:18:32,408 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:18:32,408 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:18:32,409 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:18:12" (3/4) ... [2024-11-19 01:18:32,411 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:18:32,413 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:18:32,413 INFO L158 Benchmark]: Toolchain (without parser) took 21928.20ms. Allocated memory was 148.9MB in the beginning and 513.8MB in the end (delta: 364.9MB). Free memory was 103.0MB in the beginning and 197.5MB in the end (delta: -94.6MB). Peak memory consumption was 271.4MB. Max. memory is 16.1GB. [2024-11-19 01:18:32,413 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 148.9MB. Free memory was 106.0MB in the beginning and 105.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:18:32,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 564.67ms. Allocated memory is still 148.9MB. Free memory was 102.7MB in the beginning and 114.6MB in the end (delta: -11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 01:18:32,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.85ms. Allocated memory is still 148.9MB. Free memory was 114.6MB in the beginning and 109.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 01:18:32,414 INFO L158 Benchmark]: Boogie Preprocessor took 79.23ms. Allocated memory is still 148.9MB. Free memory was 109.4MB in the beginning and 105.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:18:32,415 INFO L158 Benchmark]: RCFGBuilder took 1016.41ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 105.2MB in the beginning and 169.7MB in the end (delta: -64.6MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-11-19 01:18:32,415 INFO L158 Benchmark]: TraceAbstraction took 20163.13ms. Allocated memory was 203.4MB in the beginning and 513.8MB in the end (delta: 310.4MB). Free memory was 168.8MB in the beginning and 198.6MB in the end (delta: -29.8MB). Peak memory consumption was 279.4MB. Max. memory is 16.1GB. [2024-11-19 01:18:32,415 INFO L158 Benchmark]: Witness Printer took 4.63ms. Allocated memory is still 513.8MB. Free memory was 198.6MB in the beginning and 197.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:18:32,417 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.14ms. Allocated memory is still 148.9MB. Free memory was 106.0MB in the beginning and 105.8MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 564.67ms. Allocated memory is still 148.9MB. Free memory was 102.7MB in the beginning and 114.6MB in the end (delta: -11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.85ms. Allocated memory is still 148.9MB. Free memory was 114.6MB in the beginning and 109.4MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.23ms. Allocated memory is still 148.9MB. Free memory was 109.4MB in the beginning and 105.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1016.41ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 105.2MB in the beginning and 169.7MB in the end (delta: -64.6MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20163.13ms. Allocated memory was 203.4MB in the beginning and 513.8MB in the end (delta: 310.4MB). Free memory was 168.8MB in the beginning and 198.6MB in the end (delta: -29.8MB). Peak memory consumption was 279.4MB. Max. memory is 16.1GB. * Witness Printer took 4.63ms. Allocated memory is still 513.8MB. Free memory was 198.6MB in the beginning and 197.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 120. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 4, 1000000000000000.4, 1000.2, 256, 4, 10, 128, -2, 0, 0, 0, 1 }; [L51] unsigned short int* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] float* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L53] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L54] unsigned short int* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L55] unsigned short int* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L56] unsigned short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L57] signed short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L58] signed short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L59] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L60] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L61] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L62] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=0] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] FCALL updateLastVariables() [L128] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_float() [L95] EXPR WrapperStruct00.var_1_2 [L95] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L95] EXPR WrapperStruct00.var_1_2 [L95] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L95] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L95] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L96] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L97] EXPR WrapperStruct00.var_1_3 [L97] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L97] EXPR WrapperStruct00.var_1_3 [L97] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L97] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L97] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L97] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L98] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L100] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L101] WrapperStruct00.var_1_5 = __VERIFIER_nondet_ushort() [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L103] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L104] WrapperStruct00.var_1_6 = __VERIFIER_nondet_ushort() [L105] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L106] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L107] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= -32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= -32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L109] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L111] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L112] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L113] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L114] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L115] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, \old(cond)=1, isInitial=1] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L128] RET updateVariables() [L129] CALL step() [L66] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L66] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) [L66] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L66] EXPR (((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L66] (*(WrapperStruct00_var_1_8_Pointer)) = (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))) [L67] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L67] EXPR 50 >> (*(WrapperStruct00_var_1_4_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L67] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L67] COND FALSE !((50 >> (*(WrapperStruct00_var_1_4_Pointer))) <= (*(WrapperStruct00_var_1_8_Pointer))) [L70] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L70] (*(WrapperStruct00_var_1_10_Pointer)) = (! (*(WrapperStruct00_var_1_11_Pointer))) [L72] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L72] COND TRUE ! (*(WrapperStruct00_var_1_12_Pointer)) [L73] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L73] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L73] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L73] EXPR (((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L73] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L73] EXPR (((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L73] COND FALSE !((*(WrapperStruct00_var_1_4_Pointer)) >= (((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) [L76] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L76] (*(WrapperStruct00_var_1_13_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L79] COND TRUE (*(WrapperStruct00_var_1_2_Pointer)) >= 64.5f [L80] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L80] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L80] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_3_Pointer))) [L83] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L83] COND FALSE !((*(WrapperStruct00_var_1_13_Pointer))) [L86] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L86] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L120] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) >= 64.5f) ? (((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) < 0 ) ? -(((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : (((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 50)) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L120] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) >= 64.5f) ? (((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) < 0 ) ? -(((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : (((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 50)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L120] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) >= 64.5f) ? (((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) < 0 ) ? -(((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : (((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 50))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L120] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) >= 64.5f) ? (((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) < 0 ) ? -(((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : (((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 50))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) && (((50 >> (*(WrapperStruct00_var_1_4_Pointer))) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) ((! (! (*(WrapperStruct00_var_1_11_Pointer)))) || (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_11_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L120] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) >= 64.5f) ? (((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) < 0 ) ? -(((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : (((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 50))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) && (((50 >> (*(WrapperStruct00_var_1_4_Pointer))) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) ((! (! (*(WrapperStruct00_var_1_11_Pointer)))) || (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_11_Pointer))))))) && ((! (*(WrapperStruct00_var_1_12_Pointer))) ? (((*(WrapperStruct00_var_1_4_Pointer)) >= (((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) && (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L120-L121] return (((((*(WrapperStruct00_var_1_2_Pointer)) >= 64.5f) ? (((*(WrapperStruct00_var_1_2_Pointer)) >= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) ((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) < 0 ) ? -(((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : (((((*(WrapperStruct00_var_1_4_Pointer))) > ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((((((*(WrapperStruct00_var_1_5_Pointer))) > ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((*(WrapperStruct00_var_1_5_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))))))) : ((*(WrapperStruct00_var_1_13_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_5_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_6_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned short int) 50))) && ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed short int) (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) && (((50 >> (*(WrapperStruct00_var_1_4_Pointer))) <= (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) ((! (! (*(WrapperStruct00_var_1_11_Pointer)))) || (*(WrapperStruct00_var_1_12_Pointer))))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((unsigned char) (! (*(WrapperStruct00_var_1_11_Pointer))))))) && ((! (*(WrapperStruct00_var_1_12_Pointer))) ? (((*(WrapperStruct00_var_1_4_Pointer)) >= (((((*(WrapperStruct00_var_1_6_Pointer))) < ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_10_Pointer)) && (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_13_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_11_Pointer))))) : 1) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:20}, WrapperStruct00_var_1_11_Pointer={4:21}, WrapperStruct00_var_1_12_Pointer={4:22}, WrapperStruct00_var_1_13_Pointer={4:23}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:2}, WrapperStruct00_var_1_3_Pointer={4:6}, WrapperStruct00_var_1_4_Pointer={4:10}, WrapperStruct00_var_1_5_Pointer={4:12}, WrapperStruct00_var_1_6_Pointer={4:14}, WrapperStruct00_var_1_8_Pointer={4:16}, WrapperStruct00_var_1_9_Pointer={4:18}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 136 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 7, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3292 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3277 mSDsluCounter, 3779 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3001 mSDsCounter, 313 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4927 IncrementalHoareTripleChecker+Invalid, 5240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 313 mSolverCounterUnsat, 778 mSDtfsCounter, 4927 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 269 SyntacticMatches, 5 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=373occurred in iteration=6, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 306 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1075 NumberOfCodeBlocks, 1075 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 946 ConstructedInterpolants, 0 QuantifiedInterpolants, 10472 SizeOfPredicates, 13 NumberOfNonLiveVariables, 949 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 2784/2912 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-19 01:18:32,452 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-49.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 d884eeffd8b0023fc900bd81f692be364c6bc9fc89a5974af855cb50a9688a16 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:18:34,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:18:34,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:18:34,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:18:34,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:18:34,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:18:34,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:18:34,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:18:34,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:18:34,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:18:34,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:18:34,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:18:34,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:18:34,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:18:34,888 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:18:34,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:18:34,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:18:34,892 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:18:34,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:18:34,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:18:34,893 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:18:34,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:18:34,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:18:34,894 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:18:34,894 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:18:34,895 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:18:34,895 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:18:34,895 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:18:34,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:18:34,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:18:34,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:18:34,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:18:34,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:18:34,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:18:34,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:18:34,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:18:34,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:18:34,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:18:34,898 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:18:34,898 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:18:34,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:18:34,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:18:34,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:18:34,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:18:34,900 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 -> d884eeffd8b0023fc900bd81f692be364c6bc9fc89a5974af855cb50a9688a16 [2024-11-19 01:18:35,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:18:35,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:18:35,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:18:35,273 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:18:35,274 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:18:35,275 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-49.i [2024-11-19 01:18:36,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:18:37,180 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:18:37,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-49.i [2024-11-19 01:18:37,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbcb40ec/85850928fa684cbc89a2cac4b853a378/FLAGde9f4f2ef [2024-11-19 01:18:37,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbcb40ec/85850928fa684cbc89a2cac4b853a378 [2024-11-19 01:18:37,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:18:37,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:18:37,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:18:37,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:18:37,222 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:18:37,223 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,224 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c2d216d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37, skipping insertion in model container [2024-11-19 01:18:37,224 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,258 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:18:37,505 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-49.i[917,930] [2024-11-19 01:18:37,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:18:37,623 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:18:37,636 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-49.i[917,930] [2024-11-19 01:18:37,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:18:37,712 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:18:37,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37 WrapperNode [2024-11-19 01:18:37,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:18:37,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:18:37,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:18:37,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:18:37,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,797 INFO L138 Inliner]: procedures = 34, calls = 192, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 654 [2024-11-19 01:18:37,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:18:37,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:18:37,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:18:37,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:18:37,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,853 INFO L175 MemorySlicer]: Split 167 memory accesses to 2 slices as follows [2, 165]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 30 writes are split as follows [0, 30]. [2024-11-19 01:18:37,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:18:37,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:18:37,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:18:37,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:18:37,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (1/1) ... [2024-11-19 01:18:37,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:18:37,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:18:37,943 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-19 01:18:37,947 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-19 01:18:37,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:18:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:18:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:18:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:18:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:18:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:18:37,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:18:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:18:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:18:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:18:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:18:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:18:37,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:18:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:18:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:18:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:18:37,988 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:18:37,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:18:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:18:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:18:37,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:18:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:18:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:18:37,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:18:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:18:38,156 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:18:38,158 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:18:39,030 INFO L? ?]: Removed 212 outVars from TransFormulas that were not future-live. [2024-11-19 01:18:39,030 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:18:39,051 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:18:39,051 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:18:39,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:18:39 BoogieIcfgContainer [2024-11-19 01:18:39,051 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:18:39,054 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:18:39,054 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:18:39,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:18:39,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:18:37" (1/3) ... [2024-11-19 01:18:39,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f75a77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:18:39, skipping insertion in model container [2024-11-19 01:18:39,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:18:37" (2/3) ... [2024-11-19 01:18:39,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f75a77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:18:39, skipping insertion in model container [2024-11-19 01:18:39,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:18:39" (3/3) ... [2024-11-19 01:18:39,059 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-49.i [2024-11-19 01:18:39,077 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:18:39,077 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:18:39,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:18:39,164 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;@6edb616c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:18:39,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:18:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 114 states have internal predecessors, (167), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:18:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 01:18:39,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:39,184 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:39,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:39,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:39,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2079183880, now seen corresponding path program 1 times [2024-11-19 01:18:39,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:39,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676698417] [2024-11-19 01:18:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:39,208 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-19 01:18:39,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:39,210 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-19 01:18:39,226 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-19 01:18:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:39,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:18:39,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-19 01:18:39,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:39,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:39,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676698417] [2024-11-19 01:18:39,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676698417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:39,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:39,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:18:39,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328956898] [2024-11-19 01:18:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:39,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:18:39,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:39,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:18:39,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:18:39,683 INFO L87 Difference]: Start difference. First operand has 130 states, 113 states have (on average 1.4778761061946903) internal successors, (167), 114 states have internal predecessors, (167), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:18:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:39,722 INFO L93 Difference]: Finished difference Result 253 states and 398 transitions. [2024-11-19 01:18:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:18:39,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 115 [2024-11-19 01:18:39,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:39,732 INFO L225 Difference]: With dead ends: 253 [2024-11-19 01:18:39,732 INFO L226 Difference]: Without dead ends: 126 [2024-11-19 01:18:39,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:18:39,739 INFO L432 NwaCegarLoop]: 188 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, 188 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-19 01:18:39,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:18:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-19 01:18:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-19 01:18:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 110 states have internal predecessors, (160), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:18:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2024-11-19 01:18:39,795 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 115 [2024-11-19 01:18:39,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:39,795 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2024-11-19 01:18:39,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 01:18:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2024-11-19 01:18:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 01:18:39,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:39,799 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:39,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:18:40,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:18:40,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:40,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash -212770384, now seen corresponding path program 1 times [2024-11-19 01:18:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928766323] [2024-11-19 01:18:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:40,003 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-19 01:18:40,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:40,006 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-19 01:18:40,008 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-19 01:18:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:40,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 01:18:40,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:40,469 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 12 treesize of output 8 [2024-11-19 01:18:40,547 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 37 treesize of output 25 [2024-11-19 01:18:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-19 01:18:40,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:18:40,573 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:40,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928766323] [2024-11-19 01:18:40,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928766323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:18:40,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:18:40,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:18:40,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193131670] [2024-11-19 01:18:40,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:18:40,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:18:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:18:40,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:18:40,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:18:40,578 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:18:41,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:18:41,249 INFO L93 Difference]: Finished difference Result 300 states and 448 transitions. [2024-11-19 01:18:41,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:18:41,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2024-11-19 01:18:41,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:18:41,253 INFO L225 Difference]: With dead ends: 300 [2024-11-19 01:18:41,253 INFO L226 Difference]: Without dead ends: 177 [2024-11-19 01:18:41,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:18:41,255 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 72 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:18:41,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 517 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 01:18:41,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-19 01:18:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 130. [2024-11-19 01:18:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 114 states have (on average 1.4473684210526316) internal successors, (165), 114 states have internal predecessors, (165), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-19 01:18:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2024-11-19 01:18:41,270 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 115 [2024-11-19 01:18:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:18:41,275 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2024-11-19 01:18:41,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-19 01:18:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2024-11-19 01:18:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 01:18:41,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:18:41,278 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 01:18:41,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:18:41,478 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-19 01:18:41,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:18:41,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:18:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1840779851, now seen corresponding path program 1 times [2024-11-19 01:18:41,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:18:41,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883290326] [2024-11-19 01:18:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:41,483 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-19 01:18:41,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:18:41,486 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-19 01:18:41,487 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-19 01:18:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:41,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 01:18:41,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:44,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:18:45,560 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 23 treesize of output 22 [2024-11-19 01:18:45,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 49 [2024-11-19 01:18:45,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:45,677 INFO L349 Elim1Store]: treesize reduction 48, result has 15.8 percent of original size [2024-11-19 01:18:45,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 82 [2024-11-19 01:18:45,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 33 treesize of output 29 [2024-11-19 01:18:45,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:18:45,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 64 treesize of output 36 [2024-11-19 01:18:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-19 01:18:45,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:18:51,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:18:51,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883290326] [2024-11-19 01:18:51,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883290326] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:18:51,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1969923717] [2024-11-19 01:18:51,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:18:51,754 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:18:51,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:18:51,757 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 01:18:51,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-19 01:18:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:18:52,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 01:18:52,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:18:54,965 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 12 treesize of output 8 [2024-11-19 01:18:55,741 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 31 treesize of output 26 [2024-11-19 01:18:55,891 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-19 01:18:55,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 72 [2024-11-19 01:18:55,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:55,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 81 [2024-11-19 01:18:56,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 39 treesize of output 33 [2024-11-19 01:18:56,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:18:56,269 INFO L349 Elim1Store]: treesize reduction 94, result has 22.3 percent of original size [2024-11-19 01:18:56,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 55 treesize of output 103 [2024-11-19 01:18:56,420 INFO L349 Elim1Store]: treesize reduction 56, result has 41.1 percent of original size [2024-11-19 01:18:56,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 44 treesize of output 69 [2024-11-19 01:18:57,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:18:57,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 268 treesize of output 286 [2024-11-19 01:18:59,564 INFO L349 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2024-11-19 01:18:59,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 44 [2024-11-19 01:18:59,721 INFO L349 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2024-11-19 01:18:59,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 treesize of output 44 [2024-11-19 01:19:00,254 INFO L349 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2024-11-19 01:19:00,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 45 [2024-11-19 01:19:00,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:19:00,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 3 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 18 case distinctions, treesize of input 304 treesize of output 358