./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.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 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:35:52,588 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:35:52,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:35:52,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:35:52,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:35:52,694 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:35:52,694 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:35:52,695 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:35:52,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:35:52,698 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:35:52,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:35:52,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:35:52,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:35:52,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:35:52,702 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:35:52,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:35:52,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:35:52,703 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:35:52,703 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:35:52,703 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:35:52,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:35:52,707 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:35:52,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:35:52,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:35:52,708 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:35:52,708 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:35:52,708 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:35:52,709 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:35:52,709 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:35:52,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:35:52,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:35:52,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:35:52,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:35:52,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:35:52,712 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:35:52,712 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:35:52,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:35:52,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:35:52,713 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:35:52,713 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:35:52,713 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:35:52,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:35:52,714 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 -> 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b [2024-10-13 06:35:53,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:35:53,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:35:53,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:35:53,047 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:35:53,047 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:35:53,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-10-13 06:35:54,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:35:54,732 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:35:54,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-10-13 06:35:54,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96440f810/d363d10670ed47a183e5a5cc5673ea27/FLAGce2e2b242 [2024-10-13 06:35:54,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96440f810/d363d10670ed47a183e5a5cc5673ea27 [2024-10-13 06:35:54,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:35:54,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:35:54,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:35:54,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:35:54,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:35:54,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:35:54" (1/1) ... [2024-10-13 06:35:54,785 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22882eef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:54, skipping insertion in model container [2024-10-13 06:35:54,785 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:35:54" (1/1) ... [2024-10-13 06:35:54,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:35:55,016 WARN L248 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-17.i[917,930] [2024-10-13 06:35:55,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:35:55,102 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:35:55,114 WARN L248 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-17.i[917,930] [2024-10-13 06:35:55,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:35:55,194 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:35:55,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55 WrapperNode [2024-10-13 06:35:55,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:35:55,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:35:55,196 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:35:55,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:35:55,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,262 INFO L138 Inliner]: procedures = 29, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 632 [2024-10-13 06:35:55,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:35:55,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:35:55,263 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:35:55,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:35:55,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,331 INFO L175 MemorySlicer]: Split 156 memory accesses to 2 slices as follows [2, 154]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 19 writes are split as follows [0, 19]. [2024-10-13 06:35:55,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:35:55,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:35:55,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:35:55,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:35:55,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (1/1) ... [2024-10-13 06:35:55,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:35:55,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:35:55,441 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-10-13 06:35:55,445 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-10-13 06:35:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:35:55,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-13 06:35:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-13 06:35:55,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:35:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:35:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-13 06:35:55,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-13 06:35:55,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:35:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:35:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-13 06:35:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-13 06:35:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:35:55,498 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:35:55,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:35:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:35:55,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:35:55,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:35:55,710 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:35:55,712 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:35:56,310 INFO L? ?]: Removed 167 outVars from TransFormulas that were not future-live. [2024-10-13 06:35:56,311 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:35:56,351 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:35:56,352 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:35:56,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:35:56 BoogieIcfgContainer [2024-10-13 06:35:56,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:35:56,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:35:56,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:35:56,358 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:35:56,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:35:54" (1/3) ... [2024-10-13 06:35:56,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b45e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:35:56, skipping insertion in model container [2024-10-13 06:35:56,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:35:55" (2/3) ... [2024-10-13 06:35:56,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b45e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:35:56, skipping insertion in model container [2024-10-13 06:35:56,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:35:56" (3/3) ... [2024-10-13 06:35:56,364 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-17.i [2024-10-13 06:35:56,380 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:35:56,380 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:35:56,443 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:35:56,450 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;@fc7970, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:35:56,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:35:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:35:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:35:56,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:56,470 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:35:56,471 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:56,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:56,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1736269305, now seen corresponding path program 1 times [2024-10-13 06:35:56,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:56,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024484348] [2024-10-13 06:35:56,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:56,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:56,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:35:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:35:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:35:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:35:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:35:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:35:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:56,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:35:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:35:56,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:56,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024484348] [2024-10-13 06:35:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024484348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:56,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:35:56,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350672968] [2024-10-13 06:35:56,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:56,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:35:56,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:57,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:35:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:35:57,023 INFO L87 Difference]: Start difference. First operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:35:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:57,086 INFO L93 Difference]: Finished difference Result 271 states and 428 transitions. [2024-10-13 06:35:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:35:57,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-13 06:35:57,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:57,101 INFO L225 Difference]: With dead ends: 271 [2024-10-13 06:35:57,101 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 06:35:57,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-10-13 06:35:57,111 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:57,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:35:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 06:35:57,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-13 06:35:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.452991452991453) internal successors, (170), 117 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:35:57,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-10-13 06:35:57,161 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 136 [2024-10-13 06:35:57,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:57,162 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-10-13 06:35:57,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:35:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-10-13 06:35:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:35:57,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:57,169 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:35:57,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:35:57,170 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:57,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:57,173 INFO L85 PathProgramCache]: Analyzing trace with hash 194679485, now seen corresponding path program 1 times [2024-10-13 06:35:57,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:57,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140023128] [2024-10-13 06:35:57,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:57,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:35:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:35:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:35:57,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:35:57,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:57,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:35:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:35:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:35:57,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:35:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:57,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140023128] [2024-10-13 06:35:57,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140023128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:57,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:57,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:35:57,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179738541] [2024-10-13 06:35:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:57,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:35:57,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:57,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:35:57,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:35:57,481 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:35:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:57,538 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2024-10-13 06:35:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:35:57,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-13 06:35:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:57,540 INFO L225 Difference]: With dead ends: 271 [2024-10-13 06:35:57,540 INFO L226 Difference]: Without dead ends: 137 [2024-10-13 06:35:57,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:35:57,544 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:57,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:35:57,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-13 06:35:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-13 06:35:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:35:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2024-10-13 06:35:57,573 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 136 [2024-10-13 06:35:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:57,574 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2024-10-13 06:35:57,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:35:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2024-10-13 06:35:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:35:57,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:57,581 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:35:57,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:35:57,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2049878913, now seen corresponding path program 1 times [2024-10-13 06:35:57,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:57,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891032234] [2024-10-13 06:35:57,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:57,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:35:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:35:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:35:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:35:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:35:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:35:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:35:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:35:57,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:57,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891032234] [2024-10-13 06:35:57,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891032234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:57,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:57,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:35:57,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570093746] [2024-10-13 06:35:57,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:57,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:35:58,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:58,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:35:58,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:35:58,001 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:35:58,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:58,060 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2024-10-13 06:35:58,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:35:58,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-10-13 06:35:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:58,065 INFO L225 Difference]: With dead ends: 275 [2024-10-13 06:35:58,067 INFO L226 Difference]: Without dead ends: 139 [2024-10-13 06:35:58,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:35:58,069 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:58,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:35:58,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-13 06:35:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-13 06:35:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:35:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2024-10-13 06:35:58,081 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 136 [2024-10-13 06:35:58,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:58,082 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2024-10-13 06:35:58,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:35:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2024-10-13 06:35:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:35:58,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:58,086 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:35:58,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:35:58,087 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:58,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:58,088 INFO L85 PathProgramCache]: Analyzing trace with hash 776557572, now seen corresponding path program 1 times [2024-10-13 06:35:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:58,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521026497] [2024-10-13 06:35:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:35:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:35:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:35:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:35:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:35:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:35:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:35:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:35:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:35:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:35:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:35:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:35:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:35:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:35:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:35:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:35:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:35:58,990 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:35:58,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:35:58,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521026497] [2024-10-13 06:35:58,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521026497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:35:58,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:35:58,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:35:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538204454] [2024-10-13 06:35:58,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:35:58,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:35:58,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:35:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:35:58,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:35:58,995 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:35:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:35:59,333 INFO L93 Difference]: Finished difference Result 347 states and 514 transitions. [2024-10-13 06:35:59,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:35:59,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-13 06:35:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:35:59,339 INFO L225 Difference]: With dead ends: 347 [2024-10-13 06:35:59,339 INFO L226 Difference]: Without dead ends: 209 [2024-10-13 06:35:59,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:35:59,346 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 242 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:35:59,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 773 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:35:59,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-13 06:35:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 165. [2024-10-13 06:35:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.4421768707482994) internal successors, (212), 147 states have internal predecessors, (212), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:35:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 244 transitions. [2024-10-13 06:35:59,363 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 244 transitions. Word has length 138 [2024-10-13 06:35:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:35:59,363 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 244 transitions. [2024-10-13 06:35:59,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:35:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 244 transitions. [2024-10-13 06:35:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:35:59,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:35:59,366 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:35:59,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:35:59,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:35:59,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:35:59,367 INFO L85 PathProgramCache]: Analyzing trace with hash -32789054, now seen corresponding path program 1 times [2024-10-13 06:35:59,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:35:59,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085069703] [2024-10-13 06:35:59,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:35:59,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:35:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:36:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:36:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:36:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:36:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:36:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:36:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:01,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:36:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:02,010 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:36:02,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085069703] [2024-10-13 06:36:02,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085069703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:02,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:02,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:36:02,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695430208] [2024-10-13 06:36:02,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:02,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:36:02,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:36:02,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:36:02,015 INFO L87 Difference]: Start difference. First operand 165 states and 244 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-13 06:36:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:02,622 INFO L93 Difference]: Finished difference Result 534 states and 787 transitions. [2024-10-13 06:36:02,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:36:02,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 138 [2024-10-13 06:36:02,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:02,625 INFO L225 Difference]: With dead ends: 534 [2024-10-13 06:36:02,625 INFO L226 Difference]: Without dead ends: 370 [2024-10-13 06:36:02,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:36:02,631 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 524 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:02,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1205 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:36:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-13 06:36:02,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 301. [2024-10-13 06:36:02,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 266 states have (on average 1.4285714285714286) internal successors, (380), 266 states have internal predecessors, (380), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:36:02,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 444 transitions. [2024-10-13 06:36:02,673 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 444 transitions. Word has length 138 [2024-10-13 06:36:02,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:02,674 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 444 transitions. [2024-10-13 06:36:02,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 3 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-10-13 06:36:02,675 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 444 transitions. [2024-10-13 06:36:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:36:02,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:02,679 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:02,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:36:02,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:02,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:02,680 INFO L85 PathProgramCache]: Analyzing trace with hash -830304446, now seen corresponding path program 1 times [2024-10-13 06:36:02,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:02,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818467277] [2024-10-13 06:36:02,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:02,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:02,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:36:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:36:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:36:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:36:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:36:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:36:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:36:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:36:03,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:03,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818467277] [2024-10-13 06:36:03,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818467277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:03,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:03,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:36:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019158394] [2024-10-13 06:36:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:03,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:36:03,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:03,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:36:03,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:36:03,128 INFO L87 Difference]: Start difference. First operand 301 states and 444 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:36:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:03,413 INFO L93 Difference]: Finished difference Result 649 states and 957 transitions. [2024-10-13 06:36:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:36:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 138 [2024-10-13 06:36:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:03,416 INFO L225 Difference]: With dead ends: 649 [2024-10-13 06:36:03,416 INFO L226 Difference]: Without dead ends: 349 [2024-10-13 06:36:03,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:36:03,421 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 229 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:03,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 733 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:36:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-13 06:36:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 297. [2024-10-13 06:36:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 262 states have (on average 1.416030534351145) internal successors, (371), 262 states have internal predecessors, (371), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:36:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 435 transitions. [2024-10-13 06:36:03,453 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 435 transitions. Word has length 138 [2024-10-13 06:36:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:03,454 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 435 transitions. [2024-10-13 06:36:03,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:36:03,455 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 435 transitions. [2024-10-13 06:36:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:36:03,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:03,456 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:03,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:36:03,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:03,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash -458224815, now seen corresponding path program 1 times [2024-10-13 06:36:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:03,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114400524] [2024-10-13 06:36:03,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:03,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:04,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:36:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:36:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:36:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:36:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:36:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:36:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:36:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:36:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:04,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114400524] [2024-10-13 06:36:04,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114400524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:04,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:04,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:36:04,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52302703] [2024-10-13 06:36:04,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:04,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:36:04,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:04,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:36:04,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:36:04,319 INFO L87 Difference]: Start difference. First operand 297 states and 435 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:36:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:04,582 INFO L93 Difference]: Finished difference Result 520 states and 762 transitions. [2024-10-13 06:36:04,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:36:04,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 139 [2024-10-13 06:36:04,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:04,585 INFO L225 Difference]: With dead ends: 520 [2024-10-13 06:36:04,585 INFO L226 Difference]: Without dead ends: 352 [2024-10-13 06:36:04,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:36:04,587 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 398 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:04,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 641 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:36:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-13 06:36:04,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2024-10-13 06:36:04,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 252 states have (on average 1.4126984126984128) internal successors, (356), 252 states have internal predecessors, (356), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:36:04,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 420 transitions. [2024-10-13 06:36:04,611 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 420 transitions. Word has length 139 [2024-10-13 06:36:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:04,611 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 420 transitions. [2024-10-13 06:36:04,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:36:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 420 transitions. [2024-10-13 06:36:04,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:36:04,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:04,613 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:04,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:36:04,613 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:04,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1267571441, now seen corresponding path program 1 times [2024-10-13 06:36:04,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:04,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108065522] [2024-10-13 06:36:04,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:04,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:36:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:36:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-13 06:36:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:36:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 06:36:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:36:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 06:36:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 06:36:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 06:36:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 06:36:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 06:36:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-13 06:36:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 06:36:05,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:36:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:36:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:36:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:36:05,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:36:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108065522] [2024-10-13 06:36:05,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108065522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:05,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:05,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:36:05,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549426124] [2024-10-13 06:36:05,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:05,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:36:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:36:05,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:36:05,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:36:05,321 INFO L87 Difference]: Start difference. First operand 287 states and 420 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:05,563 INFO L93 Difference]: Finished difference Result 563 states and 821 transitions. [2024-10-13 06:36:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:36:05,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 139 [2024-10-13 06:36:05,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:05,566 INFO L225 Difference]: With dead ends: 563 [2024-10-13 06:36:05,566 INFO L226 Difference]: Without dead ends: 405 [2024-10-13 06:36:05,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:36:05,568 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 301 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:05,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 800 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:36:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-10-13 06:36:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 183. [2024-10-13 06:36:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 165 states have (on average 1.412121212121212) internal successors, (233), 165 states have internal predecessors, (233), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:36:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 265 transitions. [2024-10-13 06:36:05,588 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 265 transitions. Word has length 139 [2024-10-13 06:36:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:05,589 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 265 transitions. [2024-10-13 06:36:05,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 265 transitions. [2024-10-13 06:36:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:36:05,591 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:05,591 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:05,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:36:05,591 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:05,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash 433249426, now seen corresponding path program 1 times [2024-10-13 06:36:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:36:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065522902] [2024-10-13 06:36:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:05,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:36:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:36:05,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 06:36:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 06:36:05,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 06:36:05,815 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 06:36:05,816 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 06:36:05,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:36:05,820 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:36:05,986 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 06:36:05,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:36:05 BoogieIcfgContainer [2024-10-13 06:36:05,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 06:36:05,990 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 06:36:05,990 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 06:36:05,990 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 06:36:05,991 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:35:56" (3/4) ... [2024-10-13 06:36:05,993 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 06:36:05,994 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 06:36:05,994 INFO L158 Benchmark]: Toolchain (without parser) took 11220.95ms. Allocated memory was 153.1MB in the beginning and 358.6MB in the end (delta: 205.5MB). Free memory was 108.4MB in the beginning and 131.0MB in the end (delta: -22.7MB). Peak memory consumption was 181.2MB. Max. memory is 16.1GB. [2024-10-13 06:36:05,995 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:36:05,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.60ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 90.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 06:36:05,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.37ms. Allocated memory is still 153.1MB. Free memory was 90.3MB in the beginning and 85.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 06:36:05,995 INFO L158 Benchmark]: Boogie Preprocessor took 110.92ms. Allocated memory is still 153.1MB. Free memory was 85.7MB in the beginning and 80.7MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 06:36:05,996 INFO L158 Benchmark]: RCFGBuilder took 977.05ms. Allocated memory is still 153.1MB. Free memory was 80.7MB in the beginning and 79.1MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 06:36:05,996 INFO L158 Benchmark]: TraceAbstraction took 9634.44ms. Allocated memory was 153.1MB in the beginning and 358.6MB in the end (delta: 205.5MB). Free memory was 78.8MB in the beginning and 132.1MB in the end (delta: -53.3MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. [2024-10-13 06:36:05,996 INFO L158 Benchmark]: Witness Printer took 3.78ms. Allocated memory is still 358.6MB. Free memory was 132.1MB in the beginning and 131.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 06:36:05,998 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.17ms. Allocated memory is still 96.5MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.60ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 90.3MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.37ms. Allocated memory is still 153.1MB. Free memory was 90.3MB in the beginning and 85.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.92ms. Allocated memory is still 153.1MB. Free memory was 85.7MB in the beginning and 80.7MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 977.05ms. Allocated memory is still 153.1MB. Free memory was 80.7MB in the beginning and 79.1MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9634.44ms. Allocated memory was 153.1MB in the beginning and 358.6MB in the end (delta: 205.5MB). Free memory was 78.8MB in the beginning and 132.1MB in the end (delta: -53.3MB). Peak memory consumption was 155.4MB. Max. memory is 16.1GB. * Witness Printer took 3.78ms. Allocated memory is still 358.6MB. Free memory was 132.1MB in the beginning and 131.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 140. Possible FailurePath: [L40] unsigned char isInitial = 0; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L41-L58] struct WrapperStruct00 WrapperStruct00 = { 10000000.8, 0, 16.2, 7.5, 49.6, -10, 4.5, 9.4, 128, 128, 0, 100, 128.4, 3.5, 16, 2 }; [L59] double* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L60] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L61] double* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L62] double* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L63] double* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L64] signed short int* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L65] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L66] double* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L67] signed short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L68] signed short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L69] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L70] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L71] float* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L72] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L73] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L74] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L75] unsigned char last_1_WrapperStruct00_var_1_15 = 16; [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] CALL updateLastVariables() [L137] EXPR WrapperStruct00.var_1_15 [L137] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L147] RET updateLastVariables() [L148] CALL updateVariables() [L108] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L111] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_3 [L112] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_3 [L112] EXPR WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] EXPR (WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] EXPR (WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L113] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_4 [L114] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_4 [L114] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L115] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L116] EXPR WrapperStruct00.var_1_5 [L116] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_5 [L116] EXPR WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] EXPR (WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] EXPR (WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L117] WrapperStruct00.var_1_7 = __VERIFIER_nondet_double() [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F [L118] EXPR WrapperStruct00.var_1_7 [L118] EXPR WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] EXPR (WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] CALL assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L118] RET assume_abort_if_not((WrapperStruct00.var_1_7 >= 0.0F && WrapperStruct00.var_1_7 <= -1.0e-20F) || (WrapperStruct00.var_1_7 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_7 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L119] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F [L120] EXPR WrapperStruct00.var_1_8 [L120] EXPR WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] EXPR (WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L120] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= 0.0F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L121] WrapperStruct00.var_1_9 = __VERIFIER_nondet_short() [L122] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 16383) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L124] WrapperStruct00.var_1_10 = __VERIFIER_nondet_short() [L125] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L127] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L128] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L130] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L131] EXPR WrapperStruct00.var_1_14 [L131] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L131] EXPR WrapperStruct00.var_1_14 [L131] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L131] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L132] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L133] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L133] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L133] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L148] RET updateVariables() [L149] CALL step() [L79] (*(WrapperStruct00_var_1_12_Pointer)) = last_1_WrapperStruct00_var_1_15 [L80] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L80] unsigned long int stepLocal_1 = (*(WrapperStruct00_var_1_12_Pointer)); [L81] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L81] signed short int stepLocal_0 = (*(WrapperStruct00_var_1_9_Pointer)); [L82] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L82] COND FALSE !(stepLocal_0 >= (*(WrapperStruct00_var_1_10_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L89] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L92] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L92] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L92] COND FALSE !((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L95] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L100] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L100] (*(WrapperStruct00_var_1_6_Pointer)) = (*(WrapperStruct00_var_1_15_Pointer)) [L103] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L103] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L103] EXPR \read(*WrapperStruct00_var_1_14_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L103] COND FALSE !((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) [L149] RET step() [L150] CALL, EXPR property() [L140] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1 [L140] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) [L140] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_3_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) [L140] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L140] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L140] EXPR ((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_9_Pointer)) + last_1_WrapperStruct00_var_1_15) >= (*(WrapperStruct00_var_1_12_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_9_Pointer)) + last_1_WrapperStruct00_var_1_15) >= (*(WrapperStruct00_var_1_12_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L140-L141] return (((((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((double) ((*(WrapperStruct00_var_1_3_Pointer)) + (((((*(WrapperStruct00_var_1_4_Pointer))) < ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((49.5 + (*(WrapperStruct00_var_1_5_Pointer))))))))) : 1) && (((- ((*(WrapperStruct00_var_1_7_Pointer)) - (*(WrapperStruct00_var_1_8_Pointer)))) <= (*(WrapperStruct00_var_1_3_Pointer))) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) ((8 + (*(WrapperStruct00_var_1_15_Pointer))) - (*(WrapperStruct00_var_1_15_Pointer))))) : ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_11_Pointer)) ? ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_6_Pointer)) == ((signed short int) (*(WrapperStruct00_var_1_15_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) last_1_WrapperStruct00_var_1_15))) && (((*(WrapperStruct00_var_1_7_Pointer)) < ((*(WrapperStruct00_var_1_8_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((float) (((((*(WrapperStruct00_var_1_4_Pointer))) > (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer))))))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : (((((((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) > ((*(WrapperStruct00_var_1_3_Pointer)))) ? (((((127.4f) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? (127.4f) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_3_Pointer)))))))))) : 1)) && (((*(WrapperStruct00_var_1_9_Pointer)) >= (*(WrapperStruct00_var_1_10_Pointer))) ? ((((*(WrapperStruct00_var_1_9_Pointer)) + last_1_WrapperStruct00_var_1_15) >= (*(WrapperStruct00_var_1_12_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_16_Pointer))))) : 1) ; [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:53}, WrapperStruct00_var_1_11_Pointer={4:55}, WrapperStruct00_var_1_12_Pointer={4:56}, WrapperStruct00_var_1_13_Pointer={4:60}, WrapperStruct00_var_1_14_Pointer={4:64}, WrapperStruct00_var_1_15_Pointer={4:72}, WrapperStruct00_var_1_16_Pointer={4:73}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:8}, WrapperStruct00_var_1_3_Pointer={4:9}, WrapperStruct00_var_1_4_Pointer={4:17}, WrapperStruct00_var_1_5_Pointer={4:25}, WrapperStruct00_var_1_6_Pointer={4:33}, WrapperStruct00_var_1_7_Pointer={4:35}, WrapperStruct00_var_1_8_Pointer={4:43}, WrapperStruct00_var_1_9_Pointer={4:51}, isInitial=1, last_1_WrapperStruct00_var_1_15=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 137 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 9, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1694 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1694 mSDsluCounter, 5512 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4090 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1500 IncrementalHoareTripleChecker+Invalid, 1540 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 1422 mSDtfsCounter, 1500 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 295 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=5, InterpolantAutomatonStates: 42, 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, 8 MinimizatonAttempts, 452 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 1239 NumberOfCodeBlocks, 1239 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1092 ConstructedInterpolants, 0 QuantifiedInterpolants, 4816 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 3840/3840 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-10-13 06:36:06,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.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 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:36:08,245 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:36:08,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 06:36:08,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:36:08,342 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:36:08,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:36:08,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:36:08,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:36:08,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:36:08,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:36:08,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:36:08,382 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:36:08,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:36:08,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:36:08,384 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:36:08,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:36:08,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:36:08,388 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:36:08,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:36:08,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:36:08,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:36:08,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:36:08,391 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:36:08,391 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 06:36:08,392 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 06:36:08,392 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:36:08,392 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 06:36:08,393 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:36:08,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:36:08,393 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:36:08,393 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:36:08,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:36:08,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:36:08,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:36:08,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:36:08,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:36:08,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:36:08,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:36:08,398 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 06:36:08,398 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 06:36:08,398 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:36:08,399 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:36:08,399 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:36:08,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:36:08,400 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 06:36:08,400 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 -> 84534cb3bfeccc07f7d9003784ac5ed7fe47fc2dcd134e3b27660b6363a2fb2b [2024-10-13 06:36:08,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:36:08,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:36:08,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:36:08,785 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:36:08,787 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:36:08,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-10-13 06:36:10,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:36:10,614 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:36:10,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-17.i [2024-10-13 06:36:10,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a429c78/1751492633ac4b1598c5400b0f878abb/FLAGde97b4823 [2024-10-13 06:36:10,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6a429c78/1751492633ac4b1598c5400b0f878abb [2024-10-13 06:36:10,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:36:10,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:36:10,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:36:10,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:36:10,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:36:10,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:36:10" (1/1) ... [2024-10-13 06:36:10,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e0c5bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:10, skipping insertion in model container [2024-10-13 06:36:10,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:36:10" (1/1) ... [2024-10-13 06:36:10,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:36:10,907 WARN L248 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-17.i[917,930] [2024-10-13 06:36:11,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:36:11,024 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:36:11,035 WARN L248 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-17.i[917,930] [2024-10-13 06:36:11,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:36:11,117 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:36:11,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11 WrapperNode [2024-10-13 06:36:11,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:36:11,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:36:11,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:36:11,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:36:11,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,204 INFO L138 Inliner]: procedures = 39, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 630 [2024-10-13 06:36:11,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:36:11,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:36:11,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:36:11,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:36:11,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,281 INFO L175 MemorySlicer]: Split 156 memory accesses to 2 slices as follows [2, 154]. 99 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 16]. The 19 writes are split as follows [0, 19]. [2024-10-13 06:36:11,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,341 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:36:11,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:36:11,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:36:11,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:36:11,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (1/1) ... [2024-10-13 06:36:11,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:36:11,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:36:11,391 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-10-13 06:36:11,397 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-10-13 06:36:11,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:36:11,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-10-13 06:36:11,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-10-13 06:36:11,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-10-13 06:36:11,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-10-13 06:36:11,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-13 06:36:11,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-13 06:36:11,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-10-13 06:36:11,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-10-13 06:36:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 06:36:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-13 06:36:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-13 06:36:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-13 06:36:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-13 06:36:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-13 06:36:11,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-10-13 06:36:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-10-13 06:36:11,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-13 06:36:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-13 06:36:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-10-13 06:36:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-10-13 06:36:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-13 06:36:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-13 06:36:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-10-13 06:36:11,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-10-13 06:36:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:36:11,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:36:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:36:11,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:36:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-10-13 06:36:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-10-13 06:36:11,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-10-13 06:36:11,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-10-13 06:36:11,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-13 06:36:11,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-13 06:36:11,621 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:36:11,627 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:36:14,493 INFO L? ?]: Removed 182 outVars from TransFormulas that were not future-live. [2024-10-13 06:36:14,493 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:36:14,539 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:36:14,540 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:36:14,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:36:14 BoogieIcfgContainer [2024-10-13 06:36:14,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:36:14,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:36:14,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:36:14,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:36:14,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:36:10" (1/3) ... [2024-10-13 06:36:14,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb920e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:36:14, skipping insertion in model container [2024-10-13 06:36:14,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:36:11" (2/3) ... [2024-10-13 06:36:14,557 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb920e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:36:14, skipping insertion in model container [2024-10-13 06:36:14,557 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:36:14" (3/3) ... [2024-10-13 06:36:14,559 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-17.i [2024-10-13 06:36:14,580 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:36:14,580 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:36:14,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:36:14,651 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;@6451ca43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:36:14,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:36:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:36:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:36:14,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:14,668 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:14,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:14,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1736269305, now seen corresponding path program 1 times [2024-10-13 06:36:14,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:14,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885829858] [2024-10-13 06:36:14,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:14,687 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-10-13 06:36:14,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:14,689 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-10-13 06:36:14,690 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-10-13 06:36:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:15,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 06:36:15,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-10-13 06:36:15,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:15,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885829858] [2024-10-13 06:36:15,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885829858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:15,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:15,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:36:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254985656] [2024-10-13 06:36:15,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:15,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:36:15,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:15,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:36:15,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:36:15,327 INFO L87 Difference]: Start difference. First operand has 137 states, 118 states have (on average 1.4830508474576272) internal successors, (175), 119 states have internal predecessors, (175), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:15,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:15,385 INFO L93 Difference]: Finished difference Result 271 states and 428 transitions. [2024-10-13 06:36:15,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:36:15,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-13 06:36:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:15,397 INFO L225 Difference]: With dead ends: 271 [2024-10-13 06:36:15,398 INFO L226 Difference]: Without dead ends: 135 [2024-10-13 06:36:15,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:36:15,404 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:15,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:36:15,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-13 06:36:15,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-10-13 06:36:15,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.452991452991453) internal successors, (170), 117 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:36:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 202 transitions. [2024-10-13 06:36:15,447 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 202 transitions. Word has length 136 [2024-10-13 06:36:15,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:15,447 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 202 transitions. [2024-10-13 06:36:15,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:15,448 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 202 transitions. [2024-10-13 06:36:15,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:36:15,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:15,454 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:15,475 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-10-13 06:36:15,655 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-10-13 06:36:15,656 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:15,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash 194679485, now seen corresponding path program 1 times [2024-10-13 06:36:15,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:15,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190601969] [2024-10-13 06:36:15,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:15,658 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-10-13 06:36:15,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:15,662 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-10-13 06:36:15,663 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-10-13 06:36:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:16,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:36:16,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:16,222 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-10-13 06:36:16,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:16,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:16,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190601969] [2024-10-13 06:36:16,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190601969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:16,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:16,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:36:16,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771144233] [2024-10-13 06:36:16,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:16,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:36:16,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:16,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:36:16,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:36:16,232 INFO L87 Difference]: Start difference. First operand 135 states and 202 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:16,415 INFO L93 Difference]: Finished difference Result 271 states and 406 transitions. [2024-10-13 06:36:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:36:16,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2024-10-13 06:36:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:16,421 INFO L225 Difference]: With dead ends: 271 [2024-10-13 06:36:16,421 INFO L226 Difference]: Without dead ends: 137 [2024-10-13 06:36:16,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:36:16,425 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:16,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:36:16,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-13 06:36:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-10-13 06:36:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4453781512605042) internal successors, (172), 119 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:36:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2024-10-13 06:36:16,449 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 136 [2024-10-13 06:36:16,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:16,450 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2024-10-13 06:36:16,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2024-10-13 06:36:16,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-13 06:36:16,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:16,455 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:16,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-13 06:36:16,656 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-10-13 06:36:16,657 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:16,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:16,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2049878913, now seen corresponding path program 1 times [2024-10-13 06:36:16,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:16,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318931027] [2024-10-13 06:36:16,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:16,658 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-10-13 06:36:16,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:16,660 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-10-13 06:36:16,661 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-10-13 06:36:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:17,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 06:36:17,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:36:17,213 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:17,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:17,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318931027] [2024-10-13 06:36:17,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318931027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:17,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:17,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:36:17,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564801344] [2024-10-13 06:36:17,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:17,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:36:17,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:17,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:36:17,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:36:17,217 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:36:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:17,432 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2024-10-13 06:36:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:36:17,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2024-10-13 06:36:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:17,435 INFO L225 Difference]: With dead ends: 275 [2024-10-13 06:36:17,435 INFO L226 Difference]: Without dead ends: 139 [2024-10-13 06:36:17,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:36:17,437 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:17,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 581 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:36:17,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-13 06:36:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-10-13 06:36:17,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.43801652892562) internal successors, (174), 121 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:36:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 206 transitions. [2024-10-13 06:36:17,450 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 206 transitions. Word has length 136 [2024-10-13 06:36:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:17,451 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 206 transitions. [2024-10-13 06:36:17,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:36:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 206 transitions. [2024-10-13 06:36:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 06:36:17,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:17,453 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:17,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 06:36:17,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:36:17,654 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:17,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash 776557572, now seen corresponding path program 1 times [2024-10-13 06:36:17,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:17,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147297945] [2024-10-13 06:36:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:17,656 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-10-13 06:36:17,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:17,659 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:36:17,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 06:36:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:18,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:36:18,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:18,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:36:18,563 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 173 treesize of output 65 [2024-10-13 06:36:18,675 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-10-13 06:36:18,677 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:18,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147297945] [2024-10-13 06:36:18,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147297945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:18,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:18,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:36:18,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982111757] [2024-10-13 06:36:18,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:18,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:36:18,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:18,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:36:18,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:36:18,682 INFO L87 Difference]: Start difference. First operand 139 states and 206 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:22,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:22,335 INFO L93 Difference]: Finished difference Result 278 states and 412 transitions. [2024-10-13 06:36:22,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:36:22,336 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2024-10-13 06:36:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:22,338 INFO L225 Difference]: With dead ends: 278 [2024-10-13 06:36:22,338 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 06:36:22,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:36:22,340 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 172 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:22,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 476 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 06:36:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 06:36:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-10-13 06:36:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 121 states have internal predecessors, (173), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:36:22,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 205 transitions. [2024-10-13 06:36:22,365 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 205 transitions. Word has length 138 [2024-10-13 06:36:22,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:22,365 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 205 transitions. [2024-10-13 06:36:22,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 205 transitions. [2024-10-13 06:36:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:36:22,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:22,372 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:22,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-13 06:36:22,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 06:36:22,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:22,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:22,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1993789002, now seen corresponding path program 1 times [2024-10-13 06:36:22,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:22,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534863711] [2024-10-13 06:36:22,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:22,575 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-10-13 06:36:22,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:22,578 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 06:36:22,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 06:36:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:23,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:36:23,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:23,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:36:23,328 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 173 treesize of output 65 [2024-10-13 06:36:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2024-10-13 06:36:23,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:23,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534863711] [2024-10-13 06:36:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534863711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:23,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:23,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:36:23,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556606928] [2024-10-13 06:36:23,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:23,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:36:23,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:23,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:36:23,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:36:23,370 INFO L87 Difference]: Start difference. First operand 139 states and 205 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:27,268 INFO L93 Difference]: Finished difference Result 278 states and 410 transitions. [2024-10-13 06:36:27,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:36:27,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2024-10-13 06:36:27,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:27,270 INFO L225 Difference]: With dead ends: 278 [2024-10-13 06:36:27,270 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 06:36:27,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:36:27,271 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 164 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:27,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 470 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-13 06:36:27,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 06:36:27,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-10-13 06:36:27,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:36:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 204 transitions. [2024-10-13 06:36:27,282 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 204 transitions. Word has length 140 [2024-10-13 06:36:27,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:27,282 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 204 transitions. [2024-10-13 06:36:27,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:27,283 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 204 transitions. [2024-10-13 06:36:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:36:27,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:27,284 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:27,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-13 06:36:27,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10-13 06:36:27,485 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1909274172, now seen corresponding path program 1 times [2024-10-13 06:36:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:27,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399987660] [2024-10-13 06:36:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:27,487 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-10-13 06:36:27,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:27,490 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10-13 06:36:27,491 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 (7)] Waiting until timeout for monitored process [2024-10-13 06:36:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:28,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 06:36:28,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:28,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:36:28,417 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 173 treesize of output 65 [2024-10-13 06:36:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-13 06:36:28,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:28,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:28,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399987660] [2024-10-13 06:36:28,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399987660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:28,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:28,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:36:28,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878444743] [2024-10-13 06:36:28,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:28,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:36:28,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:28,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:36:28,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:36:28,454 INFO L87 Difference]: Start difference. First operand 139 states and 204 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:32,669 INFO L93 Difference]: Finished difference Result 278 states and 408 transitions. [2024-10-13 06:36:32,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:36:32,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2024-10-13 06:36:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:32,672 INFO L225 Difference]: With dead ends: 278 [2024-10-13 06:36:32,672 INFO L226 Difference]: Without dead ends: 140 [2024-10-13 06:36:32,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:36:32,673 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 136 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:32,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 466 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 06:36:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-13 06:36:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2024-10-13 06:36:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.4132231404958677) internal successors, (171), 121 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 06:36:32,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 203 transitions. [2024-10-13 06:36:32,690 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 203 transitions. Word has length 142 [2024-10-13 06:36:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:32,691 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 203 transitions. [2024-10-13 06:36:32,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-13 06:36:32,692 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 203 transitions. [2024-10-13 06:36:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:36:32,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:32,694 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:32,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-13 06:36:32,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-10-13 06:36:32,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:32,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:32,895 INFO L85 PathProgramCache]: Analyzing trace with hash 838356490, now seen corresponding path program 1 times [2024-10-13 06:36:32,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:32,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311874410] [2024-10-13 06:36:32,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:32,896 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-10-13 06:36:32,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:32,897 INFO L229 MonitoredProcess]: Starting monitored process 8 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-10-13 06:36:32,898 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 (8)] Waiting until timeout for monitored process [2024-10-13 06:36:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:33,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-13 06:36:33,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:33,945 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 17 treesize of output 9 [2024-10-13 06:36:35,865 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-10-13 06:36:36,030 INFO L349 Elim1Store]: treesize reduction 39, result has 27.8 percent of original size [2024-10-13 06:36:36,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 44 [2024-10-13 06:36:36,313 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:36:36,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:36,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:36,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311874410] [2024-10-13 06:36:36,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311874410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:36,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:36,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:36:36,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011204649] [2024-10-13 06:36:36,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:36,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:36:36,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:36,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:36:36,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:36:36,316 INFO L87 Difference]: Start difference. First operand 139 states and 203 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:36:47,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:47,281 INFO L93 Difference]: Finished difference Result 694 states and 1014 transitions. [2024-10-13 06:36:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:36:47,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 144 [2024-10-13 06:36:47,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:47,285 INFO L225 Difference]: With dead ends: 694 [2024-10-13 06:36:47,286 INFO L226 Difference]: Without dead ends: 556 [2024-10-13 06:36:47,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:36:47,288 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 779 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:47,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 998 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2024-10-13 06:36:47,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-13 06:36:47,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 261. [2024-10-13 06:36:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 226 states have (on average 1.4026548672566372) internal successors, (317), 226 states have internal predecessors, (317), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:36:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 381 transitions. [2024-10-13 06:36:47,316 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 381 transitions. Word has length 144 [2024-10-13 06:36:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:47,317 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 381 transitions. [2024-10-13 06:36:47,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:36:47,317 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 381 transitions. [2024-10-13 06:36:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:36:47,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:47,319 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:47,342 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 (8)] Forceful destruction successful, exit code 0 [2024-10-13 06:36:47,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-10-13 06:36:47,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:47,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:47,520 INFO L85 PathProgramCache]: Analyzing trace with hash 29009864, now seen corresponding path program 1 times [2024-10-13 06:36:47,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:47,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088124300] [2024-10-13 06:36:47,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:47,521 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-10-13 06:36:47,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:47,522 INFO L229 MonitoredProcess]: Starting monitored process 9 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-10-13 06:36:47,523 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 (9)] Waiting until timeout for monitored process [2024-10-13 06:36:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:48,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-13 06:36:48,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:48,139 INFO L349 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2024-10-13 06:36:48,139 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 29 treesize of output 33 [2024-10-13 06:36:48,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 06:36:48,187 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 90 treesize of output 66 [2024-10-13 06:36:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 06:36:48,222 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 06:36:48,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 06:36:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088124300] [2024-10-13 06:36:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088124300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:36:48,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:36:48,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:36:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993491942] [2024-10-13 06:36:48,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:36:48,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:36:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 06:36:48,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:36:48,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:36:48,224 INFO L87 Difference]: Start difference. First operand 261 states and 381 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:36:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:36:51,854 INFO L93 Difference]: Finished difference Result 634 states and 924 transitions. [2024-10-13 06:36:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:36:51,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 144 [2024-10-13 06:36:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:36:51,858 INFO L225 Difference]: With dead ends: 634 [2024-10-13 06:36:51,858 INFO L226 Difference]: Without dead ends: 374 [2024-10-13 06:36:51,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:36:51,860 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 80 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:36:51,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 695 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 06:36:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-13 06:36:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 289. [2024-10-13 06:36:51,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 254 states have (on average 1.3976377952755905) internal successors, (355), 254 states have internal predecessors, (355), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:36:51,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 419 transitions. [2024-10-13 06:36:51,893 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 419 transitions. Word has length 144 [2024-10-13 06:36:51,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:36:51,893 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 419 transitions. [2024-10-13 06:36:51,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-13 06:36:51,894 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 419 transitions. [2024-10-13 06:36:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:36:51,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:36:51,895 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:36:51,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-13 06:36:52,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-10-13 06:36:52,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:36:52,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:36:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash -768505528, now seen corresponding path program 1 times [2024-10-13 06:36:52,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 06:36:52,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981768340] [2024-10-13 06:36:52,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:36:52,098 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-10-13 06:36:52,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 06:36:52,099 INFO L229 MonitoredProcess]: Starting monitored process 10 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-10-13 06:36:52,100 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 (10)] Waiting until timeout for monitored process [2024-10-13 06:36:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:36:52,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-13 06:36:52,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 06:36:53,019 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-10-13 06:36:53,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2024-10-13 06:36:56,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2024-10-13 06:37:02,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 35 [2024-10-13 06:37:03,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 51 [2024-10-13 06:37:13,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2024-10-13 06:37:14,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2024-10-13 06:37:14,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2024-10-13 06:37:15,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 57 [2024-10-13 06:37:15,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 73